Optimally streaming greedy regular expression parsing

DOI10.1007/978-3-319-10882-7_14MaRDI QIDQ2938165zbMATH OpenOpenAlexFDO

Authors Niels Bjørn Bugge Grathwohl, Fritz Henglein, Ulrik Terp Rasmussen

Publication date 13 January 2015

Published in Theoretical Aspects of Computing – ICTAC 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10882-7_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Online algorithms; streaming algorithms (68W27)

Recommendations

• Two-pass greedy regular expression parsing
• Bit-coded Regular Expression Parsing
• Efficiently building a parse tree from a regular expression
• On the semantics of regular expression parsing in the wild
• Faster Regular Expression Matching

Cited in

(8)

• Efficiently building a parse tree from a regular expression
• From regular expression matching to parsing
• Kleenex: compiling nondeterministic transducers to deterministic streaming transducers
• On the semantics of regular expression parsing in the wild
• scientific article; zbMATH DE number 3919857 (Why is no real title available?)
• Two-pass greedy regular expression parsing
• POSIX lexing with derivatives of regular expressions
• Annotated regular expressions and input-driven languages

This page was built for publication: Optimally streaming greedy regular expression parsing

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