21. Parse tree ambiguity and structural ambiguity.22. The use of parse tree functions is highly dependent on the area which is using it. 23. The input to the code generator typically consists of a parse tree or an abstract syntax tree. 24. These candidates are incomplete solutions to the search problems, e . g . partial parse trees . 25. Parsers can automatically generate parse trees or abstract syntax trees which can be further processed with tree parsers. 26. Because these parse trees are the result of gene expression, in GEP they are called expression trees. 27. GNU gcc with option-fdump-translation-unit puts out the parse tree to a file. 28. Thus formulas are, essentially, identified with their parse trees , rather than with the strings being parsed. 29. Like lookahead and disambiguation facility, in particular when reordering the alternatives cannot specify the exact parse tree desired. 30. In OMeta, it is easy to traverse through the parse tree since such functionality is natively supported .
