Graham is a library for creating, manipulating, and analyzing context-free grammars (CFGs).
Graham also includes algorithms for generating parser automata, providing a flexible, generic approach to implementing parser-generator tools like FSharpYacc.
This section provides references to books and academic papers detailing algorithms implemented within the
Graham(Context-free grammars, deterministic parsing) projects.
Citations are presented in the Chicago style.
- DeRemer, Frank, and Thomas Pennello. "Efficient computation of LALR (1) look-ahead sets." ACM Transactions on Programming Languages and Systems (TOPLAS) 4, no. 4 (1982): 615-649.