Wuu Yang  Home/Search
Context
Related
| nctu.edu.tw/~wuuyang/./...98workshop.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: this paper, we propose such a technique. It is tempting to conjecture that the longestmatch rule is not applicable whenever a token is a prefix of another token. This is not necessarily so. For example, both "<" and "<<" are tokens in the C++ language. Since no two consecutive "<" tokens can appear in any C++ programs, two consecutive "<" characters are always interpreted as a single "<<" token. In this case, the longestmatch rule is applicable. One naturally will ask when the lonest-match rule ... (Update)
Active bibliography (related documents): More All
0.7: Mealy Machines Are A Better Model Of Lexical Analyzers - Yang (1996) (Correct)
0.2: On the Look-Ahead Problem in Lexical Analysis - Wuu Yang (1995) (Correct)
0.2: Adopt, Adapt, and Improve: UML Packages for Graph Rewrite Systems - Winter, Schürr (1997) (Correct)
Similar documents based on text: More All
0.2: ALADIN: A Scanner Generator for Incremental Programming.. - Fischer, Hammer.. (1992) (Correct)
0.2: tjV"P< 's (Wuu Yang) - Wuuyang Cis Nctu (Correct)
0.2: A Finite State and Data-Oriented Method for Grapheme to Phoneme.. - Bouma (2000) (Correct)
BibTeX entry: (Update)
@misc{ yang-can,
author = "Wuu Yang",
title = "Can We Always Adopt the Longest-Match Rule in a Scanner?",
url = "citeseer.ist.psu.edu/yang97can.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1399 Compilers: Principles (context) - Aho, Sethi et al. - 1986
242 Reference Manual (context) - Ellis, Stroustrup et al. - 1990
132 LEX --- A lexical analyzer generator (context) - Lesk, Schmidt - 1975
59 flexible compiler construction system (context) - Gray, Heuring et al. - 1992
50 Proving properties of programs by structural induction (context) - Burstall - 1969
16 Crafting a Compiler with C (context) - Fischer, LeBlanc - 1991 ACM
6 Language Translation Using PCCTS and C++: A Reference Guide - Parr - 1997
5 Programming with Modula (context) - Wirth - 1983
2 the look-ahead problem in lexical analysis - Yang - 1995
1 Mealy machines are a better model of lexical analyzers - Yang - 1996
1 A lattice framework for analyzing context-free languages wit.. (context) - Yang - 1997
1 and Compiling: Parsing (context) - Aho, Ullman et al. - 1972
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