Annotated regular expressions and input-driven languages

DOI10.1016/j.ipl.2020.105958zbMath1441.68129OpenAlexW3014641342MaRDI QIDQ783684

D. Kharzeev

Publication date: 4 August 2020

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2020.105958

zbMATH Keywords

regular expressionsformal languagesinput-driven pushdown automataLL(1) parsing

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• One-counter automata for parsing and language approximation
• Generalizing input-driven languages: theoretical and practical benefits
• Optimally Streaming Greedy Regular Expression Parsing
• Fast context-free grammar parsing requires fast boolean matrix multiplication
• On the Membership Problem for Visibly Pushdown Languages
• Visibly pushdown languages
• On Extended Regular Expressions
• Parsing with derivatives
• Automata, Languages and Programming
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• Regular Expressions with Counting: Weak versus Strong Determinism

This page was built for publication: Annotated regular expressions and input-driven languages