Elkhound: A Fast, Practical GLR Parser Generator

McPeak, Scott; Necula, George C.

doi:10.1007/978-3-540-24723-4_6

Cited by 83 publications

(64 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is particularly important in the fields of domainspecific languages and reverse engineering, where grammars should be easy to understand, evolvable, and maintainable. Therefore, the focus of this paper is mainly on providing a declarative framework for specification of precedence rules in generalized context-free parsing algorithms, such as Earley [2], GLR [3,4,5,6] and GLL [7].…”

Section: Introductionmentioning

confidence: 99%

Safe Specification of Operator Precedence Rules

Afroozeh

Brand

Johnstone

et al. 2013

Software Language Engineering

View full text Add to dashboard Cite

Abstract. In this paper we present an approach to specifying operator precedence based on declarative disambiguation constructs and an implementation mechanism based on grammar rewriting. We identify a problem with existing generalized context-free parsing and disambiguation technology: generating a correct parser for a language such as OCaml using declarative precedence specification is not possible without resorting to some manual grammar transformation. Our approach provides a fully declarative solution to operator precedence specification for contextfree grammars, is independent of any parsing technology, and is safe in that it guarantees that the language of the resulting grammar will be the same as the language of the specification grammar. We evaluate our new approach by specifying the precedence rules from the OCaml reference manual against the highly ambiguous reference grammar and validate the output of our generated parser.

show abstract

Section: Introductionmentioning

confidence: 99%

Safe Specification of Operator Precedence Rules

Afroozeh

Brand

Johnstone

et al. 2013

Software Language Engineering

View full text Add to dashboard Cite

show abstract

“…SDF is a fully declarative formalism: contrary to other BNF-based grammar specifications for both traditional (e.g., LLgen [21], YACC [26], ANTLR [46]), as well as generalized parser generators (e.g., Elkhound [38]), there is no target language embedding for semantic actions, or syntactic and semantic predicates [45]. The lack of specific-purpose target language embeddings in the grammar formalism eases reuse of a single grammar file in multiple applications.…”

Section: Language Definitionmentioning

confidence: 99%

Declarative specification of template-based textual editors

Vollebregt

Kats

Visser

2012

Proceedings of the Twelfth Workshop on Language Descriptions, Tools, and Applications

View full text Add to dashboard Cite

Syntax discoverability has been a crucial advantage of structure editors for new users of a language. Despite this advantage, structure editors have not been widely adopted. Nevertheless, the Cheetah system, developed at Capgemini, leverages a structure editor to aid domain experts modeling tax-benefit rules in a domain specific language. The structure editor suffers from a lack of free form editing and conversions from/to plain text. The Spoofax language workbench, developed at Delft University of Technology, uses a textual editor, which is syntax-aware due to immediate parsing and analyses. In this thesis we describe a migration from Cheetah to Spoofax, which aims to bring the advantages of text editing to the tax-benefit rule modeling language.During the migration, we experienced that current text-based language workbenches, such as Spoofax, require redundant specification of the ingredients for a template-based editor, which is detrimental to the quality of syntactic completion, as consistency and completeness of the definition cannot be guaranteed. We describe the design and implementation of a specification language for syntax definition based on templates. It unifies the specification of parser, pretty printer and template-based editor. We evaluate the template language by application to the tax-benefit rule modeling language and a language for mobile web applications. PrefaceAbout this thesis This work essentially consists of two parts. The first part (Chapter 2 up to Chapter 7) describes a migration of the Cheetah system at Capgemini to Spoofax, and provides the motivation for the second part. The second part (Chapter 8 up to Chapter 11) describes a language that unifies the specification of grammar, pretty printer, and templates for syntactic completion (content assist), and runtime support for the template-based editors generated from specifications in this language. The title of this thesis is derived from the second part.

show abstract

“…A number of GLR parser generators are freely available. Elkhound [16] and Harmonia [1] are two systems that provide GLR parsing capabilities. In both of these systems, a grammar is defined using an EBNF syntax.…”

Section: Parsing: From Strings To Termsmentioning

confidence: 99%