Parsing Algorithms. Lecture [5/22] Abstract Syntax Trees

This is the fifth lecture from the "Parsing Algorithms" course where we discus different parsing techniques and algorithms, and build a parser from scratch using parser generator.

In this lecture:

- CST: Concrete Syntax Tree (aka Parse Tree)
- AST: Abstract Syntax Tree
- Semantic actions
- Inline interpreter for simple DSLs
- AST nodes generation
- Parenthesized expression

#Parser #AST #BNF

[robertpalovsky]

One of the best classes on parsers, thanks!

[lawrencelee]

Do AST have any relevance for flow control such as for, if/then/else, switch ?

[IrwinRodriguez]

Hi Dmitry, I'm learning this topics because one of the things I want to create is cool stuffs for *Visual FoxPro* _(custom commands, new grammars, and so on...)_ but the problem is I only know this language and that's too bad because it is a dead language since 2015 _(that's why I want to recover some of its syntax)._ Having said that, what language can you suggest to get a deeper understanding? should I choose a compiled language for a better performance or scripting language will quite good as well?

[sezer.berber]

hi. How can i count the tokens numbers. I should count the operators with types and operations. Could you help me ?

[kaiko]

Hi! Do you have a full documentation of eva? I want to re-make it in c#...

[dvisaggio]

Great. Is there a good book you would suggest to integrate your lessons about parsing theory?

[ornh]

Should have explained semantic action and its syntax better.