Week 3 of compiler construction_澳门皇冠体育,皇冠足球比分

larstvei
2026-02-04T11:55:37.695Z
type:structured-message
www.uio.no

This week we have covered grammars, which is how we specify the syntax of a language. We have seen some examples of grammars, using BNF notation, and seen how we can derive words from the grammar. The process of deriving a word of the grammar is captured by a tree, and this tree is called a parse tree (or synonymously, a concrete syntax tree). A parse tree often contains redundant information, and might not be the most convenient representation of a program. The decisions we make about what information to keep, what to discard, and what to "reshape", yields an abstract syntax tree.

In the next few weeks, we will look at parsing, which is the process of taking a token stream, and converting it to an abstract syntax tree.

No lecture next week
...