… or not. An algorithm that is capable of parsing any context-free grammar is called … of generalised parsing algorithms. We describe, analyse and compare several algorithms that are based on Knuth’s LR parser. This work underpins the design …
PhD thesis, Royal Holloway, University of London, August 2006.… to the parse-time behaviour of these algorithms which illustrates the inefficiencies in conventional Farshi-style GLR parsing. We also describe the tool GTB …We describe the behaviour of three variants of GLR parsing: (i) Farshi’s …
SCP, 61(3):228-244, 2006. [doi]… The Scannerless Generalized LR (SGLR) parsing algorithm supports …. The Incremental Generalized LR (IGLR) parsing algorithm, on the other hand, does … the Incremental Scannerless Generalized LR (ISGLR) parsing algorithm and investigates …
Master's thesis, Delft University of Technology, July 2021. [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]… We present the Incremental Scannerless Generalized LR (ISGLR) parsing algorithm, which combines the benefits of Incremental Generalized LR (IGLR) parsing … the incrementality of ISGLR parsing. We evaluated the ISGLR parsing algorithm using …
OOPSLA 2019: 54-56 [doi]… description of parsing algorithms, by disambiguation filters is considered in order to find efficient parsing algorithms for declaratively specified … parsing algorithm by two filters is investigated. The main result is a technique …
In International Workshop on Parsing Technology (IWPT 1997). 1997: 210-224… a more powerful but more time and memory intensive parsing algorithm …, increasing the burden on the parsing algorithm even further. In this paper we investigate the application of the Right-Nulled Generalized LR parsing algorithm …
CC 2009: 126-141 [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]… the search performed whilst executing reduce actions in a GLR-style parser. We call the resulting algorithm Binary Right Nulled GLR (BRNGLR) parsing … by a parser which pre-processes its grammar or parse table into a binary form, but without …
ACTA, 44(6):427-461, 2007. [doi]… machine learning algorithms for locating and parsing such references from HTML medical … reference. We implement and compare two reference parsing algorithms. One relies …. The overall performance of these two reference parsing algorithms is about the same: above …
2009: