Abstract syntax tree pretty-printing for grammars.
Perform name analysis checks for the grammar language.
Tests of grammar semantic analysis.
Simple context-free grammar abstract syntax.
Abstract syntax tree pretty-printing for grammars.
Symbol table module containing facilities for creating and manipulating grammar symbol information.
Perform name analysis checks for the grammar language. Also, define auxiliary properties nullability, first and follow for grammar symbols. The latter are based on definitions found in the paper "Circular Reference Attributed Grammars - their Evaluation and Applications", by Magnusson and Hedin from LDTA 2003.