(Enter summary)
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 (Update)
Context of citations to this paper: More
...addressing and semantic actions can be done in di erent ways (see Section 2.2.1) 2.3. 3 Kearns s Parse Extraction In his paper [25], Kearns describes a method for extracting a parse after matching with a nite automaton. First he shows algorithms to nd matches of regular...
Cited by: More
Greedy Regular Expression Matching - Frisch, Cardell (2004)
(Correct)
RegReg: a Lightweight Generator of Robust Parsers for Irregular .. - Latendresse
(Correct)
TLex - Kearns (1991)
(Correct)
Active bibliography (related documents): More All
0.5: String Pattern Matching in a Visual Programming Language - Jackson, Bell (1997)
(Correct)
0.3: Deriving a Systolic Regular Language Recognizer - Vaccari, Backhouse (1996)
(Correct)
0.3: Calculational Derivation of Circuits - Vaccari (1998)
(Correct)
Similar documents based on text: More All
0.3: Efficient Submatch Addressing for Regular Expressions - Laurikari
(Correct)
0.2: On the Early Acquisition of Allophonic Rules - Dupoux, Peperkamp (2001)
(Correct)
0.1: Continuous Grammars - Ruckert (1999)
(Correct)
Related documents from co-citation: More All
3: Regular expression types for XML
- Hosoya, Vouillon et al. - 2000
3: ciently building a parse tree from a regular expression (context) - Dub, Feeley - 2000
2: Techniques and Tools (context) - Aho, Sethi et al. - 1988
BibTeX entry: (Update)
S. M. Kearns. Extending regular expressions with context operators and parse extraction. Software Practice and Experience, 21(8):787804, Aug. 1991. http://citeseer.ist.psu.edu/kearns91extending.html More
@article{ kearns91extending,
author = "Steven M. Kearns",
title = "Extending Regular Expressions with Context Operators and Parse Extraction",
journal = "Software - Practice and Experience",
volume = "21",
number = "8",
pages = "787-804",
year = "1991",
url = "citeseer.ist.psu.edu/kearns91extending.html" }
Citations (may not include all citations):
1911
Introduction to Automata Theory (context) - Hopcroft, Unman - 1979
1399
Compilers: Principles (context) - ho, Sethi et al. - 1986
1399
Compilers: Principles (context) - Aho, Sethi et al. - 1986
457
The Esterel synchronous programming language: design, semant..
- Berry, Gonthier - 1988
132
Lex---a lexical analyzer generator (context) - Lesk, Schmidt - 1986
76
The Icon Programming Language (context) - Griswold, Griswold - 1983
66
Derivatives of regular expressions (context) - Brzozowski - 1964
64
From regular expressions to deterministic automata (context) - Berry, Sethi - 1986
57
Regular expression search algorithm (context) - Thompson - 1968
13
Parse-tree annotations (context) - Purtilo, Callahan - 1989
11
Berkeley Software Distribution (context) - Reference - 1986
3
Specialized silicon compilers for language recognition (context) - Foster - 1984
2
A compact function for regular expression pattern matching (context) - Richards - 1979
2
A string pattern matching extension to Pascal and some compa.. (context) - Liu - 1986
2
Extending regular expressions (context) - Kearns - 1990
2
FLEX UNIX Programmer's Manual (context) - Paxson - 1988
1
Avoiding latch formation in regular expression recognizes (context) - Foster - 1984
1
Multiple perspective pattern specification: a conceptual mod.. (context) - Lipson - 1984
Documents on the same site (http://www.cs.ubc.ca/local/reading/proceedings/spe91-95/spe/spetoc.htm): More
Linkage Analysis of Processes - Yaung, Raz (1992)
(Correct)
A Scheme for Little Languages in Interactive Graphics - Beckman (1991)
(Correct)
A Dataflow Approach to Event-based Debugging - Olsson, Crawford, Ho (1991)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC