parse tree a tree structure describing the derivation of a sentence in a language according to the rules of a context-free grammar.
A parse tree for the sentence "do this" would be as shown in figure 2, wheras the sentence "stop that" has no parse tree (according to the grammar we are using) and is therefore syntactically incorrect.
The parse tree and resulting code from it is not correct according to language semantics.
To correctly parse without lookahead, there are three solutions: ...
function BOTTOM-UP-PARSE( words, grammar) returns a parse tree forest - words loop do if LENGTH(forest) = 1 and CATEGORY(forest[ 1 ]) = START(grammar) then return forest[1 ] else i = choose from {1.. .
The parse tree constructed by a compiler
Bayesian networks
A reference graph that can be garbage collected using simple reference counting
The reference graph of every purely functional data structure ...
there are often multiple possible parse trees for a given sentence. Choosing the most appropriate one usually requires semantic and contextual information.
In 1992 John Koza has used genetic algorithm to evolve programs to perform certain tasks. He called his method "genetic programming" (GP). LISP programs were used, because programs in this language can expressed in the form of a "parse tree", ...
 See also: Artificial intelligence, Parsing, Natural language processing, Knowledge, Computational linguistics
  
|
RSS
