From regular expression matching to parsing

DOI10.1007/S00236-022-00420-6MaRDI QIDQ2089747zbMATH OpenOpenAlexFDO

Authors Philip Bille, Inge Li Gørtz

Publication date 24 October 2022

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-022-00420-6

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• From Regular Expression Matching to Parsing
• Bit-coded Regular Expression Parsing
• New Algorithms for Regular Expression Matching
• Faster Regular Expression Matching
• Optimally streaming greedy regular expression parsing

Cites work

• scientific article; zbMATH DE number 5344975 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• A Four Russians algorithm for regular expression pattern matching
• A linear space algorithm for computing maximal common subsequences
• Automata, Languages and Programming
• Bit-coded Regular Expression Parsing
• Efficiently building a parse tree from a regular expression
• Fast and compact regular expression matching
• Faster Regular Expression Matching
• From Regular Expression Matching to Parsing
• New Algorithms for Regular Expression Matching
• Programming Techniques: Regular expression search algorithm
• Regular expression matching with multi-strings and intervals
• THE ABSTRACT THEORY OF AUTOMATA
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Cited in

(3)

• Translating regular expression matching into transducers
• Bit-coded Regular Expression Parsing
• scientific article; zbMATH DE number 1084695 (Why is no real title available?)

This page was built for publication: From regular expression matching to parsing

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