You are on page 1of 3

Abstract syntax trees Often (abstract) syntax trees are used instead of parse trees as the interface between

syntactic and semantic processing -- cf. T&N, Section 2.5.1. In these trees, grammatical symbols that don't help with syntactic processing can be omitted. So the form of a syntax

tree is not completely determined by the grammar. Syntax trees for algebraic expressions can look like Figure 2.10. Or they can look like the expression trees of Section 7.2.1. Note that in these trees, all nodes correspond to terminal symbols of a

grammar, and none to nonterminal symbols. Also note that the nonambiguous grammar that we presented for algebraic expressions resolves issues of associativity as well as precedence -- cf T&N, Section 7.2.2.

You might also like