Bit-coded Regular Expression Parsing

DOI10.1007/978-3-642-21254-3_32zbMath1330.68171OpenAlexW1820500785MaRDI QIDQ3004600

Lasse R. Nielsen, Fritz Henglein

Publication date: 3 June 2011

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.388.336

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Algorithms on strings (68W32)

Related Items (6)

Every bit counts: The binary representation of typed data and programs ⋮ POSIX lexing with derivatives of regular expressions ⋮ A deterministic parsing algorithm for ambiguous regular expressions ⋮ From Regular Expression Matching to Parsing ⋮ From regular expression matching to parsing ⋮ Proof-directed program transformation: A functional account of efficient regular expression matching

This page was built for publication: Bit-coded Regular Expression Parsing