Parsing expression grammars
From MaRDI portal
Publication:3452254
DOI10.1145/964001.964011zbMath1325.68120WikidataQ56443862 ScholiaQ56443862MaRDI QIDQ3452254
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
regular expressions; lexical analysis; context-free grammars; BNF; parsing expression grammars; syntactic predicates; packrat parsing; scannerless parsing; GTDPL; TDPL; unified grammars
68Q42: Grammars and rewriting systems
Related Items
Unnamed Item, Computing the Shortest String and the Edit-Distance for Parsing Expression Languages, Grammars for Indentation-Sensitive Parsing, Context-Freeness of Parsing Expression Languages is Undecidable, Linear Parsing Expression Grammars, The computational power of parsing expression grammars, Bidirectional grammars for machine-code decoding and encoding, A Verified LL(1) Parser Generator, Weak inverse neighborhoods of languages, On the incremental growth and shrinkage of LR goto-graphs, A simple P-complete problem and its language-theoretic representations, Trace-based verification of imperative programs with I/O, A linear-time simulation of deterministic \(d\)-limited automata, An on-the-fly grammar modification mechanism for composing and defining extensible languages, Ordered context-free grammars, Context-free grammars with lookahead, An extension of context-free grammars with one-sided context specifications, Recursive descent parsing for Boolean grammars, Silver: an extensible attribute grammar system, A New Method for Dependent Parsing
