… We describe the behaviour of three variants of GLR parsing: (i) Farshi’s original correction to Tomita’s non-general algorithm; (ii) the Right Nulled GLR … the inefficiencies in conventional Farshi-style GLR parsing. We also describe the tool GTB …
SCP, 61(3):228-244, 2006. [doi]… the search performed whilst executing reduce actions in a GLR-style parser. We call the resulting algorithm Binary Right Nulled GLR (BRNGLR) parsing …Tomita-style generalised LR (GLR) algorithms extend the standard LR algorithm …
ACTA, 44(6):427-461, 2007. [doi]… of many standard parsing techniques. The traditional separation between lexer and parser falls short due to the limitations of tokenization based on regular expressions when handling multiple lexical grammars. In such cases scannerless parsing …
CC 2009: 126-141 [doi]… The Tomita parsing algorithm adapts Knuth’s (1967) well-known parsing algorithm … is the length of the string to be parsed. This is often significantly better than the O(n3|G|2) worst case time required by standard parsing algorithms …
In Generalized LR Parsing. pages 35-42, Springer US, Boston, MA, 1991. [doi]… of a comparative study of three variants of the Tomita-style GLR parsing algorithm … and objects associated with them such as parsers, languages and derivations. GTB has … by these parsers and the amount of searching required during the parse, which abstracts …
ENTCS, 110:97-113, 2004. [doi]… Algorithms for general CF parsing, e.g., Earley’s algorithm (Earley, 1968 … efficient than algorithms for restricted CF parsing, e.g., the LL, operator precedence … not been widely used as practical parsers for programming languages. …
In Generalized LR Parsing. pages 43-59, Springer US, Boston, MA, 1991. [doi]