Annotated regular expressions and input-driven languages

DOI10.1016/J.IPL.2020.105958MaRDI QIDQ783684zbMATH OpenOpenAlexFDO

Authors 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

formal languagesregular expressionsinput-driven pushdown automataLL(1) parsing

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Generalizing input-driven languages: theoretical and practical benefits
• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• scientific article; zbMATH DE number 1502115
• Pattern expressions and pattern automata
• scientific article; zbMATH DE number 3885334

Cites work

• A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
• Automata, Languages and Programming
• Deterministic regular expressions with back-references
• Fast context-free grammar parsing requires fast Boolean matrix multiplication
• Generalizing input-driven languages: theoretical and practical benefits
• On Extended Regular Expressions
• On the Membership Problem for Visibly Pushdown Languages
• One-counter automata for parsing and language approximation
• Optimally streaming greedy regular expression parsing
• Parsing with derivatives
• Regular expressions with counting: weak versus strong determinism
• Visibly pushdown languages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q783684)