Wuu Yang  Home/Search
Context
Related
| nctu.edu.tw/~wuuyang/./pap...CTHPC95.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)
Active bibliography (related documents): More All
0.0: On the Look-Ahead Problem in Lexical Analysis - Wuu Yang (1995) (Correct)
0.0: Mealy Machines Are A Better Model Of Lexical Analyzers - Yang (1996) (Correct)
0.0: The Complexity of Natural Language - Mahoney (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: Can We Always Adopt the Longest-Match Rule in a Scanner? - Yang (1997) (Correct)
BibTeX entry: (Update)
@misc{ yang-tabledriven,
author = "Wuu Yang",
title = "Table-Driven Look-Ahead Lexical Analysis",
url = "citeseer.ist.psu.edu/yang94tabledriven.html" }
Citations (may not include all citations):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
16 Crafting a Compiler with C (context) - Fischer, LeBlanc - 1991 ACM
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