MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Extending Regular Expressions with Context Operators and Parse Extraction (1991) [5 citations — 1 self]

by Steven M. Kearns
Software - Practice and Experience
Add To MetaCart

Abstract:

This paper improves the regular expression language by making it more expressive, and it makes regular expressions more useful by showing how to extract more information from a successful match

Citations

2870 Introduction to automata theory, languages and computation – Hopcroft, Ullman - 1979
552 The Esterel synchronous programming language: design, semantics, implementation – Berry, Gonthier - 1992
124 The icon programming language – Griswold, Griswold - 1990
117 LEX – a lexical analyzer generator – Lesk, Schmidt - 1975
112 Derivatives of Regular Expressions – Brzozowski - 1964
79 Regular expression search algorithm – Thompson - 1968
67 From Regular Expressions to Deterministic Automata – Berry, Sethi - 1986
8 Parse-Tree Annotations – Purtilo, Callahan - 1989
4 Specialized silicon compilers for language recognition – Foster - 1984
2 Extending regular expressions – Kearns - 1990
2 Avoiding latch formation in regular expression recognizes – Foster - 1984
2 A string pattern matching extension to Pascal and some comparisons with SNOBOL4’, Software–Practice and Experience – Liu - 1986
1 A compact function for regular expression pattern matching – Richards - 1979
1 Multiple perspective pattern specification: a conceptual model for string processing – Lipson - 1984