On string pattern matching: A quantitative analysis and a proposal

DOI10.1016/0096-0551(88)90004-5MaRDI QIDQ3773379zbMATH OpenOpenAlexFDO

Authors Ken-Chih Liu

Publication date 1988

Published in Computer Languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-0551(88)90004-5

zbMATH Keywords

parsingpattern matchingSNOBOL4string processing languages

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of compilers and interpreters (68N20) Formal languages and automata (68Q45)

Recommendations

• A string pattern matching extension to pascal and some comparisons with snobol4
• Algorithms for pattern matching
• Fastest Pattern Matching in Strings
• scientific article; zbMATH DE number 1792103
• Some perils of performance prediction: A case study on pattern matching

Cited in

(12)

• A study in string processing languages
• Formal derivation of a pattern matching algorithm
• Some perils of performance prediction: A case study on pattern matching
• Algorithms for pattern matching
• A string pattern matching extension to pascal and some comparisons with snobol4
• scientific article; zbMATH DE number 1792103 (Why is no real title available?)
• Generalized pattern matching and periodicity under substring consistent equivalence relations
• Functional and Logic Programming
• The practical efficiency of convolutions in pattern matching algorithms
• String Matching: Communication, Circuits, and Learning.
• scientific article; zbMATH DE number 7756108 (Why is no real title available?)
• An analysis of the Karp-Rabin string matching algorithm

This page was built for publication: On string pattern matching: A quantitative analysis and a proposal

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