Parse Tree

A Parse Tree is a Tree Data Item that represents the syntax rules associated with the creation of a formal sentence.

AKA: Syntax Tree, Syntactic Parse Tree.
Example(s):
- a Natural Language Sentence Parse Tree.
- a Programming Language Sentence Parse Tree, produced by a Linguistic Parser.
See: Syntactic Parsing Task, String Pattern.

References

http://en.wikipedia.org/wiki/Concrete_syntax_tree
- A concrete syntax tree or parse tree is an (ordered, rooted) tree that represents the syntactic structure of a string according to some formal grammar. In a parse tree, the interior nodes are labeled by non-terminals of the grammar, while the leaf nodes are labeled by terminals of the grammar. A program that produces such trees is called a parser. Parse trees may be generated for sentences in natural languages (see natural language processing), as well as during processing of computer languages, such as programming languages. Parse trees are distinct from abstract syntax trees (also known simply as syntax trees), in that their structure and elements more concretely reflect the syntax of the input language.