#### Filter Results:

- Full text PDF available (3)

#### Publication Year

1991

2013

- This year (0)
- Last 5 years (2)
- Last 10 years (2)

#### Publication Type

#### Journals and Conferences

#### Key Phrases

Learn More

- Steven M. Kearns
- Softw., Pract. Exper.
- 1991

Regular expressions are used in many applications to specify patterns because any regular expression can be compiled into a very efficient one-pass pattern matcher called a finite automaton. Finding matches is useful, but even more useful is parse extraction, which describes in detail how a pattern matches some input. After matching an address, for example,… (More)

- Steven M. Kearns
- Softw., Pract. Exper.
- 1991

TLex is a pattern matching and parsing library for C++. In comparison to existing pattern matching tools, TLex sets a new standard for expressiveness when nearly optimal speed is required. It incorporates recent advances in regular expression technology that make it easier to write patterns and extract information from a successful match. An overview of… (More)

- Steven M. Kearns
- ArXiv
- 2013

- Steven M. Kearns
- 2013

We give algorithms to accelerate the computation of deterministic finite automata (DFA) by calculating the state of a DFA n positions ahead utilizing a reverse scan of the next n characters. Often this requires scanning fewer than n characters resulting in a fraction of the input being skipped and a commensurate increase in processing speed. The skipped… (More)

- ‹
- 1
- ›