Faster Scannerless GLR Parsing

Economopoulos, Giorgios; Klint, Paul; Vinju, Jurgen

doi:10.1007/978-3-642-00722-4_10

Cited by 19 publications

(14 citation statements)

References 19 publications

(28 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However with the advent of more powerful computers, newer parsing methods (such as scanner-less RNGLR (Economopoulos et al, 2009), Yakker (Jim et al, 2010) and Packrat (Ford, 2002)) are fast enough that the use of a dedicated scanner is unnecessary.…”

Section: Extensible Parsingmentioning

confidence: 99%

Critical Analysis of Extensible Parsing Tools and Techniques

Šaikūnas¹

2017

BJMC

View full text Add to dashboard Cite

Abstract. In recent years, a new type of compilers and programming languages has emerged, called extensible compilers and programming languages. These new tools are created in hope to extend lifetime and usability of programming languages by allowing users to define new language constructs with their own syntax and semantics. In this paper we focus on a subset of extensible programming languages, called reflectively extensible programming languages that allow definition of syntax and semantics extensions to be mixed with regular code. To facilitate the creation of such compilers and languages, new parsing and semantic analysis algorithms are required. This paper analyses available extensible parsers, semantic analysers, compilers and highlights further possible research directions in this field. We find that existing parsing, semantic analysis methods, compilers and compiler generators are insufficient for implementation of reflectively extensible programming languages and that creation of new parsing and semantic analysis methods with specific qualities is required to facilitate such implementations.

show abstract

Section: Extensible Parsingmentioning

confidence: 99%

Critical Analysis of Extensible Parsing Tools and Techniques

Šaikūnas¹

2017

BJMC

View full text Add to dashboard Cite

show abstract

“…Despite that, there have been attempts to augment various existing parsing methods, including Earley and GLR, to enable parsing of context-dependant constraints in [8]. A variation of RNGLR parser suitable for scanerless parsing is described in [9].…”

Section: Related Workmentioning

confidence: 99%

Parsing with Earley Virtual Machines

Šaikūnas¹

2017

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

Abstract-Earley parser is a well-known parsing method used to analyse context-free grammars. While being less efficient in practical contexts than other generalized context-free parsing algorithms, such as GLR, it is also more general. As such it can be used as a foundation to build more complex parsing algorithms.We present a new, virtual machine based approach to parsing, heavily based on the original Earley parser. We present several variations of the Earley Virtual Machine, each with increasing feature set. The final version of the Earley Virtual Machine is capable of parsing context-free grammars with data-dependant constraints and support grammars with regular right hand sides and regular lookahead.We show how to translate grammars into virtual machine instruction sequences that are then used by the parsing algorithm. Additionally, we present two methods for constructing shared packed parse forests based on the parse input.

show abstract

“…There have been a number of recent efforts to build parser generators that support unrestricted context-free grammars [24,32,30,6]. In particular, McPeak has made a number of convincing arguments for abandoning the constraints of LR [23].…”

Section: Towards Full Context-free Grammarsmentioning

confidence: 99%

Semantics and algorithms for data-dependent grammars

Jim

Mandelbaum

Walker

2010

Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

View full text Add to dashboard Cite

Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YAKKER, capable of handling the requirements of modern applications including (1) full scannerless context-free grammars with (2) regular expressions as right-hand sides for defining nonterminals. YAKKER also includes (3) facilities for binding variables to intermediate parse results and (4) using such bindings within arbitrary constraints to control parsing. These facilities allow the kind of data-dependent parsing commonly needed in systems applications, particularly those that operate over binary data. In addition, (5) nonterminals may be parameterized by arbitrary values, which gives the system good modularity and abstraction properties in the presence of data-dependent parsing. Finally, (6) legacy parsing libraries, such as sophisticated libraries for dates and times, may be directly incorporated into parser specifications. We illustrate the importance and utility of this rich format specification language by presenting its use on examples ranging from difficult programming language grammars to web server logs to binary data specification. We also show that our grammars have important compositionality properties and explain why such properties are important in modern applications such as automatic grammar induction.In terms of technical contributions, we provide a traditional high-level semantics for our new grammar formalization and show how to compile these grammars into nondeterministic automata. These automata are stack-based, somewhat like conventional pushdown automata, but are also equipped with environments to track data-dependent parsing state. We prove the correctness of our translation of data-dependent grammars into these new automata and then show how to implement the automata efficiently using a variation of Earley's parsing algorithm.

show abstract

Faster Scannerless GLR Parsing

Cited by 19 publications

References 19 publications

Critical Analysis of Extensible Parsing Tools and Techniques

Critical Analysis of Extensible Parsing Tools and Techniques

Parsing with Earley Virtual Machines

Semantics and algorithms for data-dependent grammars

Contact Info

Product

Resources

About