Indentation-sensitive parsing for Parsec

Adams, Michael D.; Ağacan, Ömer S.

doi:10.1145/2633357.2633369

Cited by 14 publications

(15 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Accordingly, we can make a precedencepreserving form of ASTs by folding from the repetition. #Int [1] #Int [2] $left $right $left $right #Mul #Add #Int [1] #Int [1] #Int [2] $left $right $left $right Figure 1. Mathematical basic operators and example of ASTs…”

Section: Ast Operatorsmentioning

confidence: 99%

“…• JavaScript -Based on JavaScript grammar for PEG.js 2 . We simplify the grammar specification using the parsing condition InOperator that distinguishes expression rules from the for/in context.…”

Section: Case Studies and Experiencesmentioning

confidence: 99%

“…We start by describing common setups. All tests in this paper are measured on DELL XPS-8700, with 3.4GHz 1 https://github.com/antlr/grammars-v4/blob/master/java8/Java8.g4 2 All tested Nez grammars are available online as described in Section 6. For convenience, we label tested grammars: java.nez, js.nez, python3.nez, xml.nez, and xmlsym.nez.…”

Section: Performance Studymentioning

confidence: 99%

“…Yet, there have been several declarative attempts for PEG extensions. Adams has recently formalized Indent-Sensitive CFGs [1] for the indentation-based code layout and has extended the PEG-version of IS-CFGs [2]. Iwama et al have extended PEGs with the e U e operator to combine a black-boxed parser for a natural language [12].…”

Section: Related Workmentioning

confidence: 99%

See 3 more Smart Citations

Nez: practical open grammar language

Kuramitsu

2016

Proceedings of the 2016 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software

View full text Add to dashboard Cite

Nez is a PEG(Parsing Expressing Grammar)-based open grammar language that allows us to describe complex syntax constructs without action code. Since open grammars are declarative and free from a host programming language of parsers, software engineering tools and other parser applications can reuse once-defined grammars across programming languages.A key challenge to achieve practical open grammars is the expressiveness of syntax constructs and the resulting parser performance, as the traditional action code approach has provided very pragmatic solutions to these two issues. In Nez, we extend the symbol-based state management to recognize context-sensitive language syntax, which often appears in major programming languages. In addition, the Abstract Syntax Tree constructor allows us to make flexible tree structures, including the left-associative pair of trees. Due to these extensions, we have demonstrated that Nez can parse not all but many grammars.Nez can generate various types of parsers since all Nez operations are independent of a specific parser language. To highlight this feature, we have implemented Nez with dynamic parsing, which allows users to integrate a Nez parser as a parser library that loads a grammar at runtime. To achieve its practical performance, Nez operators are assembled into low-level virtual machine instructions, including automated state modifications when backtracking, transactional controls of AST construction, and efficient memoization in packrat parsing. We demonstrate that Nez dynamic parsers achieve very competitive performance compared to existing efficient parser generators.

show abstract

Section: Ast Operatorsmentioning

confidence: 99%

Section: Case Studies and Experiencesmentioning

confidence: 99%

Section: Performance Studymentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Nez: practical open grammar language

Kuramitsu

2016

Proceedings of the 2016 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software

View full text Add to dashboard Cite

show abstract

“…Since semantic actions are written in a host language of the generated parser, the use of semantic actions may 1 Zuken Inc. He worked this paper when he studied in Yokohama National University 2 Graduate School of Electronic and Computer Engineering, Yokohama National University, 79-1 Tokiwadai, Hodogaya-ku, Yokohama 240-8501 JAPAN a) kimio@ynu.ac.jp invalidate the declarative property of PEGs, thus resulting in reduced reusability of grammars. As a result, many developers need to redevelop grammars for their software engineering tools.…”

Section: Introductionmentioning

confidence: 99%

A Declarative Extension of Parsing Expression Grammars for Recognizing Most Programming Languages

Matsumura

Kuramitsu

2016

Journal of Information Processing

View full text Add to dashboard Cite

Parsing Expression Grammars are a popular foundation for describing syntax. Unfortunately, several syntax of programming languages are still hard to recognize with pure PEGs. Notorious cases appears: typedef-defined names in C/C++, indentation-based code layout in Python, and HERE document in many scripting languages. To recognize such PEG-hard syntax, we have addressed a declarative extension to PEGs. The "declarative" extension means no programmed semantic actions, which are traditionally used to realize the extended parsing behavior. Nez is our extended PEG language, including symbol tables and conditional parsing. This paper demonstrates that the use of Nez Extensions can realize many practical programming languages, such as C, C#, Ruby, and Python, which involve PEG-hard syntax.

show abstract

Efficient parsing with parser combinators

Kurs

Vraný

Ghafari

et al. 2018

Science of Computer Programming

View full text Add to dashboard Cite

Parser combinators offer a universal and flexible approach to parsing. They follow the structure of an underlying grammar, are modular, well-structured, easy to maintain, and can recognize a large variety of languages including context-sensitive ones. However, these advantages introduce a noticeable performance overhead mainly because the same powerful parsing algorithm is used to recognize even simple languages. Time-wise, parser combinators cannot compete with parsers generated by well-performing parser generators or optimized handwritten code. Techniques exist to achieve a linear asymptotic performance of parser combinators, yet there is a significant constant multiplier. The multiplier can be lowered to some degree, but this requires advanced meta-programming techniques, such as staging or macros, that depend heavily on the underlying language technology. In this work we present a language-agnostic solution. We optimize the performance of parsing combinators with specializations of parsing strategies. For each combinator, we analyze the language parsed by the combinator and choose the most efficient parsing strategy. By adapting a parsing strategy for different parser combinators we achieve performance comparable to that of handwritten or optimized parsers while preserving the advantages of parsers combinators.

show abstract

Indentation-sensitive parsing for Parsec

Cited by 14 publications

References 6 publications

Nez: practical open grammar language

Nez: practical open grammar language

A Declarative Extension of Parsing Expression Grammars for Recognizing Most Programming Languages

Efficient parsing with parser combinators

Contact Info

Product

Resources

About