Compiling regular patterns
From MaRDI portal
Publication:5261267
DOI10.1145/944705.944712zbMATH Open1315.68077OpenAlexW2083270921MaRDI QIDQ5261267FDOQ5261267
Authors: Michael Y. Levin 
Publication date: 2 July 2015
Published in: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/944705.944712
Recommendations
- CONCUR 2004 - Concurrency Theory
- scientific article; zbMATH DE number 1638660
- Regular expression patterns
- Pattern Matching
- Algorithms for the compilation of regular expressions into PLAs
- scientific article; zbMATH DE number 1231691
- Expressions of pattern sequences
- On matching generalised repetitive patterns
- Optimizing pattern matching
- Database Programming Languages
Cited In (11)
- Some methods for ``normalizing patterns
- Title not available (Why is that?)
- Pattern matching for the masses using custom notations
- Database Programming Languages
- Semantics-directed compilation of nonlinear patterns
- Regular expression pattern matching for XML
- Optimizing pattern matching
- Principles of plasma pattern and alternative structure compilation
- Statically checkable pattern abstractions
- Formal validation of pattern matching code
- Regular expression pattern matching for XML
This page was built for publication: Compiling regular patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261267)
