Parsing expression grammars

DOI10.1145/964001.964011zbMath1325.68120OpenAlexW2018045485WikidataQ56443862 ScholiaQ56443862MaRDI QIDQ3452254

Bryan Ford

Publication date: 11 November 2015

Published in: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/964001.964011

zbMATH Keywords

regular expressionslexical analysiscontext-free grammarsBNFparsing expression grammarssyntactic predicatespackrat parsingscannerless parsingGTDPLTDPLunified grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (20)

Computing the Shortest String and the Edit-Distance for Parsing Expression Languages ⋮ A linear-time simulation of deterministic \(d\)-limited automata ⋮ Recursive descent parsing for Boolean grammars ⋮ Silver: an extensible attribute grammar system ⋮ Ordered context-free grammars ⋮ A simple P-complete problem and its language-theoretic representations ⋮ Trace-based verification of imperative programs with I/O ⋮ Weak inverse neighborhoods of languages ⋮ Unnamed Item ⋮ Context-Freeness of Parsing Expression Languages is Undecidable ⋮ On the incremental growth and shrinkage of LR goto-graphs ⋮ A New Method for Dependent Parsing ⋮ Context-free grammars with lookahead ⋮ A Verified LL(1) Parser Generator ⋮ An on-the-fly grammar modification mechanism for composing and defining extensible languages ⋮ An extension of context-free grammars with one-sided context specifications ⋮ Linear Parsing Expression Grammars ⋮ The computational power of parsing expression grammars ⋮ Bidirectional grammars for machine-code decoding and encoding ⋮ Grammars for Indentation-Sensitive Parsing

This page was built for publication: Parsing expression grammars