Parser Combinators for Ambiguous Left-Recursive Grammars

Frost, Richard A.; Hafiz, Rahmatullah; Callaghan, Paul D.

doi:10.1007/978-3-540-77442-6_12

Cited by 29 publications

(30 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Frost et al [7] present an approach for supporting direct left recursion based on the length of the input. In this approach, the number of calls to recognizers at each input position is maintained.…”

Section: Left-recursion Curtailment Using the Input Lengthmentioning

confidence: 99%

Practical, general parser combinators

Izmaylova

Afroozeh

Storm

2016

Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

View full text Add to dashboard Cite

Parser combinators are a popular approach to parsing where contextfree grammars are represented as executable code. However, conventional parser combinators do not support left recursion, and can have worst-case exponential runtime. These limitations hinder the expressivity and performance predictability of parser combinators when constructing parsers for programming languages.In this paper we present general parser combinators that support all context-free grammars and construct a parse forest in cubic time and space in the worst case, while behaving nearly linearly on grammars of real programming languages. Our general parser combinators are based on earlier work on memoized ContinuationPassing Style (CPS) recognizers. First, we extend this work to achieve recognition in cubic time. Second, we extend the resulting cubic CPS recognizers to parsers that construct a binarized Shared Packed Parse Forest (SPPF).Our general parser combinators bring the best of both worlds: the flexibility and extensibility of conventional parser combinators and the expressivity and performance guarantees of general parsing algorithms. We used the approach presented in this paper as the basis for Meerkat, a general parser combinator library for Scala.

show abstract

Section: Left-recursion Curtailment Using the Input Lengthmentioning

confidence: 99%

Practical, general parser combinators

Izmaylova

Afroozeh

Storm

2016

Proceedings of the 2016 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation

View full text Add to dashboard Cite

show abstract

“…In [18], Frost, Hafiz and Callaghan propose a set of parser combinators that can be efficiently used for treating ambiguous grammar (even left-recursive grammars). Their algorithm combines memoization (a technique for storing the values of a function instead of re-computing them each time the function is called) with existing techniques for dealing with left recursion.…”

Section: Related Workmentioning

confidence: 99%

Analysis Of Names Of Organic Chemical Compounds By Using Parser Combinators And The Generative Lexicon Theory

Dias¹,

Julia²,

Pereira³

2011

IJAIA

View full text Add to dashboard Cite

show abstract

“…We can run the example parser in the OCaml top-level, and OCaml responds with the expected result: let = run parser3' oracle parse E "1111111" − : int list = [7] We can also examine the left and middle components of our example parser. Most interesting is the middle component:…”

Section: Examplementioning

confidence: 99%

“…7 Related to this is the requirement that users do not annotate two different parsers with the same nonterminal; the following must be avoided:…”

Section: Parsing Combinatorsmentioning

confidence: 99%

Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle

Ridge

2014

Software Language Engineering

View full text Add to dashboard Cite

Abstract. Parsers for context-free grammars can be implemented directly and naturally in a functional style known as "combinator parsing", using recursion following the structure of the grammar rules. Traditionally parser combinators have struggled to handle all features of context-free grammars, such as left recursion. Previous work introduced novel parser combinators that could be used to parse all context-free grammars. A parser generator built using these combinators was proved both sound and complete in the HOL4 theorem prover.

show abstract

Parser Combinators for Ambiguous Left-Recursive Grammars

Cited by 29 publications

References 11 publications

Practical, general parser combinators

Practical, general parser combinators

Analysis Of Names Of Organic Chemical Compounds By Using Parser Combinators And The Generative Lexicon Theory

Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle

Contact Info

Product

Resources

About