See this document in CiteSeerX!

Maximal-Munch" Tokenization in Linear Time  (Make Corrections)  
THOMAS REPS University of Wisconsin The lexical-analysis (or scanning) phase...
ACM Transactions on Programming Languages and Systems



  Home/Search   Context   Related

 
View or download:
wisc.edu/wpis/papers/tr1347.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wisc.edu/wpis/papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Devices]: Models of Computation - automata; F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems - pattern matching; I.2.8 [Artificial Intelligence]: Problem Solving, Control Methods, and Search - backtracking, dynamic programming; I.5.4 [Pattern Recognition]: Applications - text processing General Terms: Algorithms, Theory Additional Key Words and Phrases: memoization, tabulation, tokenization 1. (Update)

Active bibliography (related documents):   More   All
1.4:   Maximal-Munch" Tokenization in Linear Time - Thomas Reps University   (Correct)
0.3:   Analysing the Implicit Complexity of Programs - Marion (2000)   (Correct)
0.2:   Sharing of Computations - Amtoft (1993)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@article{ reps98maximalmunch,
    author = "Thomas Reps",
    title = "``Maximal-Munch'' Tokenization in Linear Time",
    journal = "ACM Transactions on Programming Languages and Systems",
    volume = "20",
    number = "2",
    month = "March",
    publisher = "ACM Press",
    pages = "259--273",
    year = "1998",
    url = "citeseer.ist.psu.edu/765186.html" }
Citations (may not include all citations):
1911   Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1450   The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
1399   Compilers: Principles (context) - Aho, Sethi et al. - 1986
347   Fast pattern matching in strings (context) - Knuth, Morris et al. - 1977
132   Lex - A lexical analyzer generator (context) - Lesk - 1975
127   Principles of Compiler Design (context) - Aho, Ullman - 1977
91   Data Structures and Algorithms 1: Sorting and Searching (context) - Mehlhorn - 1984
82   Algorithms for finding patterns in strings (context) - Aho - 1990
36   Compiler Design (context) - Wilhelm, Maurer - 1995
36   Compiler Construction - Waite, Goos - 1983
16   Linear time simulation of deterministic two-way pushdown aut.. (context) - Cook - 1972
12   BenjaminCumming Publishing Company (context) - LeBlanc, Benjamin et al. - 1988
5   Lexical analysis (context) - DeRemer - 1974
5   A note on linear time simulation of deterministic two-way pu.. (context) - Jones - 1977
3   Generalizing Cook's transformation to imperative stack progr.. (context) - Andersen, Jones - 1994
2   WORM-2DPDAs: An extension to 2DPDAs that can be simulated in.. (context) - Mogensen - 1994

Documents on the same site (http://www.cs.wisc.edu/wpis/papers/):   More
Program Generalization for Software Reuse: From C to C++ - Siff, Reps (1996)   (Correct)
Modular Pointer Analysis - Susan Horwitz And   (Correct)
Weighted Pushdown Systems and Weighted Transducers - Lal, Touili, Kidd, Reps   (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