W. Yang, On the look-ahead problem in lexical analysis, ACTA Informatica 32 pp. 459-476 (1995). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Can We Always Adopt the Longest-Match Rule in a Scanner? - Yang (1997) Self-citation (Yang) (Correct)
....check (of both the lexical specification and the syntactic specification) has not been studied in details previously. The work reported here may be viewed as 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 analyzer as a Moore machine. The scangen scanner generator [5] exhibits some flavor of a Mealy machine. A deterministic Mealy machine model is proposed in [12] for ....
W. Yang, On the look-ahead problem in lexical analysis, ACTA Informatica 32 pp. 459-476 (1995).
Mealy Machines Are A Better Model Of Lexical Analyzers - Yang (1996) Self-citation (Yang) (Correct)
....of Moore machines. By contrast, these operations can be encoded naturally in the Mealy machines. The look ahead problem can be divided into two subclasses: 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 analyzers. In this paper, we propose two techniques to solve the infinitelookahead problem. The first technique is a new notation, called the cut operator, in ....
....the underlying data structure of the data parallel lexical analysis algorithm because there is no need of buffering and re scanning in Mealy machines. 3 The remainder of this paper is organized as follows. The next section reviews important definitions and results concerning suffix automata [2]. We present the cut operator and define the generalized suffix automata in the third section. In the fourth section, we derive the Mealy machine from a generalized suffix automaton. We discuss the lexical analysis with genralized suffix automata and with the corresponding Mealy machine in the ....
[Article contains additional citation context not shown here]
W. Yang, On the look-ahead problem in lexical analysis, ACTA Informatica 32 pp. 459-476 (1995).
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