Terminal and nonterminal functions: Difference between revisions
Replacing merge template; alternative target (arising from discussion); see Talk:Terminal and nonterminal symbols#Proposed merge with Terminal and nonterminal functions |
Filled in 1 bare reference(s) with reFill 2 |
||
| Line 5: | Line 5: | ||
==Background== |
==Background== |
||
[[Image:parseTree.svg|right|150px|thumb|A simple [[parse tree]].]] |
[[Image:parseTree.svg|right|150px|thumb|A simple [[parse tree]].]] |
||
A [[parse tree]] is made up of nodes and branches.<ref> |
A [[parse tree]] is made up of nodes and branches.<ref>{{Cite web|url=https://www1.essex.ac.uk/linguistics/external/clmt/latex4ling/trees/parsetree/|title=The parsetree Package for Drawing Trees in LaTeX|website=www1.essex.ac.uk}}</ref> In the picture below the parse tree is the entire structure, starting from S and ending in each of the leaf nodes (John,ball,the,hit). |
||
In a parse tree, each node is either a ''root'' node, a ''branch'' node, or a ''leaf'' node. In the above example, S is a root node, NP and VP are branch nodes, while John, ball, the, and hit are all leaf nodes. |
In a parse tree, each node is either a ''root'' node, a ''branch'' node, or a ''leaf'' node. In the above example, S is a root node, NP and VP are branch nodes, while John, ball, the, and hit are all leaf nodes. |
||
Revision as of 21:24, 16 May 2020
 | It has been suggested that this article be merged into Parse tree. (Discuss) Proposed since September 2019. |
In computer science, a nonterminal function is a function (node) in a parse tree which is either a root or a branch in that tree whereas a terminal function is a function (node) in a parse tree which is a leaf.
Background
A parse tree is made up of nodes and branches.[1] In the picture below the parse tree is the entire structure, starting from S and ending in each of the leaf nodes (John,ball,the,hit).
In a parse tree, each node is either a root node, a branch node, or a leaf node. In the above example, S is a root node, NP and VP are branch nodes, while John, ball, the, and hit are all leaf nodes.
Nodes can also be referred to as parent nodes and child nodes. A parent node is one which has at least one other node linked by a branch under it. In the example, S is a parent of both NP and VP. A child node is one which has at least one node directly above it to which it is linked by a branch of the tree. Again from our example, hit is a child node of V.
See also
References
- ^ "The parsetree Package for Drawing Trees in LaTeX". www1.essex.ac.uk.