Greedy regular expression matching

DOI10.1007/978-3-540-27836-8_53MaRDI QIDQ5466499zbMATH OpenOpenAlexFDO

Authors Alain Frisch, Luca Cardelli

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Formal languages and automata (68Q45) Nonnumerical algorithms (68W05)

Cited in

(20)

• Adapting functional programs to higher order logic
• A deterministic parsing algorithm for ambiguous regular expressions
• From regular expression matching to parsing
• Formalising and implementing Boost POSIX regular expression matching
• On the semantics of regular expression parsing in the wild
• NR-grep: A fast and flexible pattern-matching tool
• POSIX Lexing with Derivatives of Regular Expressions (Proof Pearl)
• From ambiguous regular expressions to deterministic parsing automata
• On the semantics of regular expression parsing in the wild
• \textit{BSP}: a parsing tool for ambiguous regular expressions
• Disambiguation in regular expression matching via position automata with augmented transitions
• Hedge Pattern Partial Derivative
• Translating regular expression matching into transducers
• Proof-directed program transformation: a functional account of efficient regular expression matching
• A Computational Interpretation of Context-Free Expressions
• Non-wellfounded proof theory for (Kleene+action)(algebras+lattices)
• From Regular Expression Matching to Parsing
• POSIX lexing with derivatives of regular expressions
• Annotated regular expressions and input-driven languages
• PiDuce- A project for experimenting web services technologies

This page was built for publication: Greedy regular expression matching

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