Bit-coded Regular Expression Parsing
From MaRDI portal
Recommendations
- From regular expression matching to parsing
- From Regular Expression Matching to Parsing
- A deterministic parsing algorithm for ambiguous regular expressions
- Two-pass greedy regular expression parsing
- Extended regular expressions: succinctness and decidability
- Extended Regular Expressions: Succinctness and Decidability
- A fast bit-parallel algorithm for matching extended regular expressions
- Parameterized regular expressions and their languages
- Parameterized regular expressions and their languages
Cited in
(16)- Efficiently building a parse tree from a regular expression
- A deterministic parsing algorithm for ambiguous regular expressions
- From regular expression matching to parsing
- On the semantics of regular expression parsing in the wild
- Optimally streaming greedy regular expression parsing
- On the semantics of regular expression parsing in the wild
- \textit{BSP}: a parsing tool for ambiguous regular expressions
- Every bit counts: the binary representation of typed data and programs
- Relaxed parsing of regular approximations of string-embedded languages
- Proof-directed program transformation: a functional account of efficient regular expression matching
- From Regular Expression Matching to Parsing
- POSIX regular expression parsing with derivatives
- Two-pass greedy regular expression parsing
- Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression
- POSIX lexing with derivatives of regular expressions
- Efficient expansion of factored expressions
This page was built for publication: Bit-coded Regular Expression Parsing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004600)
