Anonymous user
Recursive descent parser generator: Difference between revisions
no edit summary
m (J: clean residual trash) |
No edit summary |
||
Line 1:
{{draft task}}
Write a recursive descent parser generator that takes a description of a grammar as input and outputs the source code for a parser in the same language as the generator. (So a generator written in C++ would output C++ source code for the parser.) You can assume that all of the rules have been preprocessed into a form suitable for the construction of a recursive descent parser.
* http://www.cs.engr.uky.edu/~lewis/essays/compilers/rec-des.html
* http://www.engr.mun.ca/~theo/Misc/exp_parsing.htm
Use the parser generator and a grammar file to build a parser that takes an arithmetic expression and turns it in to three address code. The resulting parser should take this (or something similar) as input:
| |||