Recursive Descent Parser

Question

The book \'Modern Compiler Design\' is the nice book about compilers. In its source code something that is annoying me is AST or Abstract Syntax Tree. Suppose we want to wri

Answer 1

Nine times out of ten you'll save the AST in memory for whatever you are doing after lexing and parsing are done.

Once you have an AST you can do a number of things:

• Evaluate it directly (perhaps using recursion, perhaps using your own custom stack)
• Transform it into some other output, such as code in another language or some other type of translation.
• Compile it to preferred instruction set
• etc.