11. Computer scientists often need to manipulate abstract syntax trees. 12. These are recognizers that process abstract syntax trees which can be automatically generated by parsers. 13. Algebraic data types are highly-suited to implementing abstract syntax . 14. These tree parsers are unique to ANTLR and greatly simplify the processing of abstract syntax trees. 15. The first working drafts of the abstract syntax , reference and synopsis were published in July 2002. 16. The parser typically retrieves this information from the lexer and stores it in the abstract syntax tree. 17. The input to the code generator typically consists of a parse tree or an abstract syntax tree. 18. The abstract syntax tree is at the center of the syntax extensions, which are in fact OCaml programs. 19. Parsers can automatically generate parse trees or abstract syntax trees which can be further processed with tree parsers. 20. They would all converge to an abstract syntax tree in a unique format that a compiler can handle.
