From Regular Expression Matching to Parsing

DOI10.4230/LIPIcs.MFCS.2019.71OpenAlexW2970877528MaRDI QIDQ5092434

Philip Bille, Inge Li Gørtz

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1804.02906

zbMATH Keywords

algorithmsregular expressionsfinite automataregular expression parsing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

A deterministic parsing algorithm for ambiguous regular expressions ⋮ From regular expression matching to parsing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• Efficiently building a parse tree from a regular expression
• Fast and compact regular expression matching
• Bit-coded Regular Expression Parsing
• THE ABSTRACT THEORY OF AUTOMATA
• New Algorithms for Regular Expression Matching
• Faster Regular Expression Matching
• A linear space algorithm for computing maximal common subsequences
• A Four Russians algorithm for regular expression pattern matching
• Automata, Languages and Programming

This page was built for publication: From Regular Expression Matching to Parsing