A parse tree is often the output of a parser. It typically follows the grammar of the underlying natural language or formal notation, with higher level nodes tagged with non-terminal symbols of the grammar and leaves tagged with terminal symbols and connected to actual words in the text. In a formal grammar, such as for a programming language or a mathematical formulae, the parse tree may be executed or evaluated dircetly by an interpreter or compiled into lower-level code or later execution.
Used in Chap. 13: pages 191, 193, 194, 195, 202
Parse tree for the query "Who belongs to a union?"
Parse tree for the query "Does Sam Smith work in the IT Department?"