Linear Parsing Expression Grammars

DOI10.1007/978-3-319-53733-7_20zbMath1485.68126arXiv1707.01814OpenAlexW2588815050MaRDI QIDQ5739004

Nariyoshi Chida, Kimio Kuramitsu

Publication date: 1 June 2017

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.01814

zbMATH Keywords

parsing expression grammarspackrat parsingBoolean finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (3)

Context-Freeness of Parsing Expression Languages is Undecidable ⋮ Context-free grammars with lookahead ⋮ The computational power of parsing expression grammars

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• On equations for regular languages, finite automata, and sequential networks
• Optimization of LR(k) parsers
• Parsing expression grammars
• Constructions for alternating finite automata^∗
• Alternation
• Parsing algorithms with backtrack
• Programming Techniques: Regular expression search algorithm

This page was built for publication: Linear Parsing Expression Grammars