… The Scannerless Generalized LR (SGLR) parsing algorithm supports the development of composed languages seamlessly but does not support incremental parsing. The Incremental Generalized LR (IGLR) parsing algorithm, on the other hand, does …
Master's thesis, Delft University of Technology, July 2021. [doi]… We present the Incremental Scannerless Generalized LR (ISGLR) parsing algorithm, which combines the benefits of Incremental Generalized LR (IGLR) parsing and Scannerless Generalized LR (SGLR) parsing. The parser preprocesses the input …
OOPSLA 2019: 54-56 [doi]… MLR, an extended LR parser, is introduced, and its application to natural language parsing is discussed. An LR parser is a ~;hift-reduce parser which is doterministically guided by a parsing table. A parsing table can be obtained …
COLING 1984: 354-357 [doi]… This thesis concerns the parsing of context-free grammars. A parser is a tool … or not. An algorithm that is capable of parsing any context-free grammar is called a generalised (context-free) parser. This thesis is devoted to the theoretical analysis …
PhD thesis, Royal Holloway, University of London, August 2006.… A method is presented for parsing syntactic constructs that are permitted … by its own grammar and parsed by a separate coroutine. The coroutine model of parsing allows the program text to be parsed in one pass despite the syntactic …
TOPLAS, 2(3):290-306, 1980. [doi]… Current deterministic parsing techniques have a number of problems. These include the limitations of parser generators for deterministic languages and the complex interface between scanner and parser. Scannerless parsing is a parsing …
Technical Report P9707, 1997.… 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]… parser needs to be generated for every combination of extensions. The generation of parse tables is expensive, which is a particular problem when the composition ….
In this paper we introduce an algorithm for parse table composition to support …
SLE 2008: 74-94 [doi]… is a function that selects a subset from a set of parse trees—the possible parse trees … description of disambiguation methods independent of parsing. Although filters can be implemented straightforwardly as functions that prune the parse forest produced …
In International Workshop on Parsing Technology (IWPT 1997). 1997: 210-224… We describe the behaviour of three variants of GLR parsing: (i) Farshi’s … to the parse-time behaviour of these algorithms which illustrates the inefficiencies in conventional Farshi-style GLR parsing. We also describe the tool GTB …
SCP, 61(3):228-244, 2006. [doi]… recursive descent parser on the given grammar. Parsing a non-terminal …-terminal symbol, is used to manufacture appropriate parsing visitors.
Our object-oriented formulation for predictive recursive descent parsing eliminates …
sigcse 2005: 477-481 [doi]… by several existing parser generators resides at the grammar level, which means … ambiguities have to be resolved before generating a single parser for the language … this problem, we have developed a novel parsing algorithm that we call Component-based …
Comp. Lang., Syst. \& Struct., 36(1):16-33, 2010. [doi]… We discuss generalisations of bottom up parsing, emphasising the relative costs …: here we analyse two approaches to correct GLR parsing (i) the modification due … is asymptotically the fastest parser in this family and show that the recently reported …
CC 2004: 89-103 [doi]… . The sentences are useful for testing parsing programs and for debugging … some automatically generated simpleLR(1) parsers are also given. …
BIT Numerical Mathematics, 12:366-375, 1972. [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]… In this paper we present the fusion of generalized LR parsing and scannerless parsing. This combination supports syntax definitions in which all aspects …, instead of implicit defaults that are taken by traditional scanner and parser …
CC 2002: 143-158 [doi]… . Therefore we looked for a parser technique that helps us to generate an OCL parser … within the scope of the Dresden OCL Toolkit. The resulting Dresden OCL2 parser …
2005: