WUU YANG Computer and Information Science Department, National Chiao-Tung...  Home/Search
Context Related
Links: DBLP | nctu.edu.tw/~wuuyang/./p...lookahead.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nctu.edu.tw/~wuuyang/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Modern programming languages use regular expressions to define valid tokens. Traditional lexical analyzers based on minimum deterministic finite automata for regular expressions cannot handle the look-ahead problem. The scanner writer needs to explicitly identify the look-ahead states and code the buffering and re-scanning operations by hand. We identify the class of finite look-ahead finite automata, which is general enough to include all finite automata of practical lexical analyzers.... (Update)
Context of citations to this paper: More
...the finite lookahead problem and the infinite lookahead problem. Previously, we solved the finite lookahead problem with suffix automata [2]. Backtracking is avoided if the suffix automata, rather than the traditional minimum deterministic automata, are used in the lexical...
...a refined longest match rule. The longestmatch rule is widely used in compiler implementation [2, 5] and has been studied in details in [11], where the author proposed a new lexical analysis method to solve the look ahead problem. Most compiler textbooks treat a lexical...
Cited by: More
Can We Always Adopt the Longest-Match Rule in a Scanner? - Yang (1997) (Correct)
Mealy Machines Are A Better Model Of Lexical Analyzers - Yang (1996) (Correct)
Similar documents (at the sentence level):
25.1%: Table-Driven Look-Ahead Lexical Analysis - Yang (1994) (Correct)
Active bibliography (related documents): More All
0.7: General Incremental Lexical Analysis - Wagner, Graham (1997) (Correct)
0.4: An Implementation of the Haskell Language - Spinellis (1990) (Correct)
0.3: A Model and Toolset for the Uniform Tagging of Encoded Documents - Barnes, MAMRAK (1991) (Correct)
Similar documents based on text: More All
0.2: tjV"P< 's (Wuu Yang) - Wuuyang Cis Nctu (Correct)
0.1: A Flexible Architecture for Building Data Flow Analyzers - Dwyer, Clarke (1996) (Correct)
0.1: Mixtures of Factor Analyzers - McLachlan, Peel (Correct)
Related documents from co-citation: More All
2: Crafting a Compiler with C (context) - Fischer, LeBlanc - 1991
2: Compilers: Principles (context) - Aho, Sethi et al. - 1986
2: LEX --- A lexical analyzer generator (context) - Lesk, Schmidt - 1975
BibTeX entry: (Update)
W. Yang, On the look-ahead problem in lexical analysis, ACTA Informatica 32 pp. 459-476 (1995). http://citeseer.ist.psu.edu/22368.html More
@article{ yang95lookahead,
author = "Wuu Yang",
title = "On the Look-Ahead Problem in Lexical Analysis",
journal = "Acta Informatica",
volume = "32",
number = "5",
month = "????",
pages = "459--476",
year = "1995",
url = "citeseer.ist.psu.edu/22368.html" }
Citations (may not include all citations):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 DBLP
137 Efficient string matching: An aid to bibliographic search (context) - Aho, Corasick - 1975 DBLP
132 LEX --- A lexical analyzer generator (context) - Lesk, Schmidt - 1975
74 Computer Science Department (context) - Paxson - 1990
24 Software---Practice and Experience (context) - Waite - 1986
16 Crafting a Compiler with C (context) - Fischer, LeBlanc - 1991
12 Automatic generation of efficient lexical processors using f.. (context) - Johnson, Porter et al. - 1968 ACM DBLP
8 Mkscan---An interactive scanner generator (context) - Horspool, Levy - 1987
7 Alex --- A simple and efficient scanner generator (context) - Mossenbock - 1986
5 The automatic generation of fast lexical analysers (context) - Heuring - 1986 ACM DBLP
5 Incremental scanning and parsing with Galaxy (context) - Beetem, Beetem - 1991
5 Programming with Modula (context) - Wirth - 1985
4 Automating Language Implementation (context) - Koskimies, Paakki - 1990
4 ALADIN: A scanner generator for incremental programming envi.. - Fischer, Hammer et al. - 1992 DBLP
3 Efficient generation of lexical analysers (context) - Grosch - 1989 DBLP
3 LexAGen: An interactive incremental scanner generator - Szafron, Ng - 1990 ACM DBLP
2 Conflict detection and resolution in a lexical analyzer gene.. (context) - Nawrocki - 1991 ACM DBLP
Documents on the same site (http://www.cis.nctu.edu.tw/~wuuyang/): More
Conditional Evaluation in Simple Multi-Visit Attribute-Grammar.. - Yang (1997) (Correct)
A Data-Parallel Algorithm For Minimum-Width Tree Layout And Its.. - Yang (1995) (Correct)
Mealy Machines Are A Better Model Of Lexical Analyzers - Yang (1996) (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