Skip to content

Latest commit

 

History

History
7 lines (4 loc) · 626 Bytes

File metadata and controls

7 lines (4 loc) · 626 Bytes

simple-recursive-descent-parser-for-toy-grammar

A simple recursive descent parser implemented in C, to evaluate a simple grammar for arithmetic expressions.

This repository directly builds upon skeleton files written and provided by Prof. Hing Leung, PhD, NMSU for the course CS370 (Compiler and Automata). The Wiki for this repository contains the lab prompt as written by Dr. Leung.

To distinguish my work from Dr. Leung's, simply compare the skeleton files (in skeleton_files) with the files in the main repository folder.