The formalization and implementation of Adaptable Parsing Expression Grammars

Reis, Leonardo V. S.; Bigonha, Roberto da Silva; Iorio, Vladimir O. Di; Amorim, Luis Eduardo S.

doi:10.1016/j.scico.2014.02.020

Cited by 7 publications

(6 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, an experiment on parsing programs with SugarJ using a prototype version of an APEG interpreter indicates that APEG may significantly improve the performance of parsing such programs, when compared to the original implementation built with SDF [16].…”

Section: Resultsmentioning

confidence: 99%

“…The parsing expression {g¼adapt(g,r);} is an update expression of APEG, and it is defined within the symbols {and}. That update expression extends the grammar g with new rules, encoded in the string r. The function adapt receives a grammar and a string representing the rules to be added to it and returns a new grammar, which contains the new rules [16]. APEG only permits modifying the grammar by creating new rules or adding new choices to the end of existing rules [16].…”

Section: Adaptable Parsing Expression Grammarmentioning

confidence: 99%

“…Although APEG has been originally proposed as a formalism for defining the syntax of extensible languages [14,16] (self-extension as defined by Erdweg et al), its dynamic behavior is able to specify these kinds of language composition, in the syntactic level. In this section, we discuss how each type of language composition can be defined using APEG.…”

Section: Language Compositionmentioning

confidence: 99%

“…Later, in a prototype interpreter that was developed [16], extensions on the base grammar were restricted by the addition of new rules or by the addition of new choices at the end of an existing rule. As APEG has ordered choices as in PEG, language extension could not be always possible.…”

Section: Language Extension and Restrictionmentioning

confidence: 99%

“…Otherwise, both choices fail. Although APEG may present this problem when extending a language, it can be avoided as we did when extending the SugarJ language with some DSLs [16].…”

Section: Language Extension and Restrictionmentioning

confidence: 99%

See 4 more Smart Citations

An on-the-fly grammar modification mechanism for composing and defining extensible languages

Reis¹,

Iorio²,

Bigonha³

2015

Computer Languages, Systems & Structures

Self Cite

View full text Add to dashboard Cite

a b s t r a c tAdaptable Parsing Expression Grammar (APEG) is a formal method for defining the syntax of programming languages. It provides an on-the-fly mechanism to perform modifications of the syntax of the language during parsing time. The primary goal of this dynamic mechanism is the formal specification and the automatic parser generation for extensible languages. In this paper, we show how APEG can be used for the definition of the extensible languages SugarJ and Fortress, clarifying many aspects of the syntax of these languages. We also show that the mechanism for on-the-fly modification of syntax rules can be useful for defining grammars in a modular way, implementing almost all types of language composition in the context of specification of extensible languages.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Adaptable Parsing Expression Grammarmentioning

confidence: 99%

Section: Language Compositionmentioning

confidence: 99%

Section: Language Extension and Restrictionmentioning

confidence: 99%

“…Otherwise, both choices fail. Although APEG may present this problem when extending a language, it can be avoided as we did when extending the SugarJ language with some DSLs [16].…”

Section: Language Extension and Restrictionmentioning

confidence: 99%

See 3 more Smart Citations

An on-the-fly grammar modification mechanism for composing and defining extensible languages

Reis¹,

Iorio²,

Bigonha³

2015

Computer Languages, Systems & Structures

Self Cite

View full text Add to dashboard Cite

show abstract

A Mixed Approach for Building Extensible Parsers

Reis

Iorio

Bigonha

2014

Programming Languages

View full text Add to dashboard Cite

Adaptable Parsing Expression Grammars

Reis

Bigonha

Iorio

et al. 2012

Programming Languages

View full text Add to dashboard Cite

Parser generators have been used for more than 50 years. Tools like YACC can automatically build a parser from a formal definition of the syntax of a language, usually based on context-free grammars (CFG). The main motivation for automatic parser generation is compiler correctness and recognition completeness, since with manual implementation it is very difficult to guarantee that all programs in a given language will be correctly analysed. Despite the advantagens mentioned above, the technology of automatic parser generation is still not available for languages that allow on-the-fly modifications on their own set of grammar rules. There is a lack of appropriate formal models for describing the syntax of these languages, therefore efficient parsers may not be automatically generated, requiring handwritten code. In this thesis, we present the design and formal definition of Adaptable Parsing Expression Grammars (APEG), an extension to the Parsing Expression Grammar (PEG) model that allows the modification of production rules during the analysis of an input string. We also show that APEG is capable to define languages that require on-the-fly modifications and allows automatic generation of parsers that are reasonably efficient to be used in practice.

show abstract

The formalization and implementation of Adaptable Parsing Expression Grammars

Cited by 7 publications

References 17 publications

An on-the-fly grammar modification mechanism for composing and defining extensible languages

An on-the-fly grammar modification mechanism for composing and defining extensible languages

A Mixed Approach for Building Extensible Parsers

Adaptable Parsing Expression Grammars

Contact Info

Product

Resources

About