W. L. Johnson, J. H. Porter, S. I. Ackley, and D. T. Ross. Automatic generation of efficient lexical processors using finite state techniques. Communications of the ACM, 11(12):805--813, 1968.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to model a calling convention s placement of arguments (and return values) a machine s memory locations. The use of FSA s for modeling parts of a compiler, and as an implementation tool, has a long and successful history. For example, FSA s have often been used to implement lexical analyzers [4]. More recently, Proebsting and Fraser [5] and Mller [6] have used finite state automata to model and detect structural hazards in pipelines for instruction scheduling. 3.1 P FSA Representation An example FSA that we use to model calling convention placement is shown in Figure 2. This FSA ....

.... typedef struct struct 2 unsigned char field[2] struct 2; void test function callee( void test function caller( dblcvt cvt; static struct 2 struct 2 arg 3 = 0x34,0x8f, double double arg 2; cvt.bytes[0] 0xe2; cvt.bytes[1] 0xed; cvt.bytes[2] 0xab; cvt.bytes[3] 0xad; cvt.bytes[4] = 0x67; cvt.bytes[5] 0x31; cvt.bytes[6] 0xee; cvt.bytes[7] 0x7; double arg 2 = cvt.dbl; test function callee(0x44026097l, double arg 2, struct 2 arg 3) typedef union unsigned char bytes[8] double dbl; dblcvt; typedef struct struct 2 unsigned char field[2] struct 2; void ....

[Article contains additional citation context not shown here]

W. L. Johnson, J. H. Porter, S. I. Ackley, and D. T. Ross, "Automatic generation of efficient lexical processors using finite state techniques," Communications of the ACM, vol. 11, no. 12, pp. 805--813, 1968.

....in numerous textbooks and in any basic undergraduate curriculum in computer science. Since its introduction in the 1950 s, the theory had numerous applications in practically all branches of computer science, from the construction of electrical circuits [11] to the design of lexical analyzers [10], and to the automated verification of hardware and software designs [30] Corresponding Author. Email addresses: nirp wisdom.weizmann.ac.il, vardi cs.rice.edu (Moshe Y. Vardi) URLs: http: www.wisdom.weizmann.ac.il nirp, http: www.cs.rice.edu vardi (Moshe Y. Vardi) 1 Supported ....

W. Johnson, J. Porter, S. Ackley, D. Ross, Automatic generation of efficient lexical processors using finite state techniques, Communications of the ACM 11 (12) (1968) 805--813.

....in numerous textbooks and in any basic undergraduate curriculum in computer science. Since its introduction in the 1950 s, the theory had numerous applications in practically all branches of computer science, from the construction of electrical circuits [Koh70] to the design of lexical analyzers [JPAR68], and to the automated verification of hardware and software designs [VW86] From its very inception, one fundamental theme in automata theory is the quest for understanding the relative power of the various constructs of the theory. Perhaps the most fundamental result of automata theory is the ....

W.L. Johnson, J.H. Porter, S.I. Ackley, and D.T. Ross. Automatic generation of efficient lexical processors using finite state techniques. Communications of the ACM, 11(12):805--813, 1968.

....specify any action in the translation rule. Such general purpose tools often provide too much general functionality, and too little aid in generating actions for more specific function sets. Action routines can become very complicated in order to determine the token class of a given token. RWORD [22],Lex [16] LAWS [23] Flex [24] Rex [25] andWart [26] are all general purpose lexical analyzer generators. They each use regular expressions as their specification mechanism. They all accept arbitrary action routines and generate code for a lexical analyzer that may be used in conjunction with a ....

Walter L. Johnson, James H. Porter, Stephanie I. Ackley, and Douglas T. Ross, `Automatic generation of efficient lexical processors using finite state techniques', Communications of the ACM, 11(12), 805--813, (December 1968).

....for later usage. Every token represents a lexical unit. No other part of the compiler has to deal with the raw program. In the early days of computer science, the lexical analysis was not a separate part. It was tied into the syntax analysis and caused a large part of the runtime of the compiler [Johnson68]. 3.1 Regular Languages The common way to describe the basic components of a program is using a regular language. It can be described by a regular grammar or regular expressions. The latter are first discussed in [Kleene56] Their productions are very restricted. The left side of it is only a ....

....languages for which this is not the case (example APL 1 ) are also difficult to understand for humans. This insight had influences in forming the way programming languages are constructed today. Before, lexical properties have been assigned a very minor role in computer languages, [Johnson68]. 1 IF IF = THEN THEN THEN = ELSE ELSE ELSE = END END can be a legal statement in APL. Comprehensive Examen, Spring 1995 #13 If the keywords of the language are reserved, the machine can distinguish between them and user defined symbols. Beside providing a token, special information about ....

[Article contains additional citation context not shown here]

W. L. Johnson, J. H. Porter, S. I. Ackerly, and D. T. Ross, "Automatic Generation of Efficient Lexical Processors Using Finite State Techniques", Communications of the Association for Computer Machinery, Vol. 11, No. 12, December 1968, pp. 805--813

....have about the same performance as those generated by Lex. Key words: lexical analysis, scanner generator, incremental compiler Accpeted for publication in Software Practice Experience INTRODUCTION Since the introduction of scanner generators as a general tool for compiler construction [1] in the mid 60 s, a vast number of systems have been designed and implemented, for example Lex [2] Flex [3] Rex [4] GRAMOL [5] LEXXO [6] or Alex [7] This paper describes another system called ALADIN (Advanced Lexical Analyzers DescriptIoN method) which is especially designed for applications ....

W.L. Johnson et al., 'Automatic Generation of Efficient Lexical Processors Using Finite State Techniques', Comm. of the ACM, 12, 805--813, (1968).

....evaluated several different C calling conventions [DAVI91] No attempts have been made to formally analyze calling conventions. On the other hand, the use of FSA for modeling parts of a compiler, and as an implementation tool has a long and successful history. For example, Johnson et al. [JOHN68] describe the use of FSA s to implement lexical analyzers. More recently, Proebsting and Fraser [PROE94] and Muller [MULL93] have used finite state automata to model and detect structural hazards in pipelines for instruction scheduling. 8 Summary Current methods of procedure call specification ....

Johnson, W.L., J.H. Porter, S.I. Ackley, and D.T. Ross. Automatic generation of efficient lexical processors using finite state techniques, Communications of the ACM, 11:(12), 805--813.

....several different C Page 13 of 14 calling conventions [DW91] No attempts have been made to formally analyze calling conventions. On the other hand, the use of FSA for modeling parts of a compiler, and as an implementation tool has a long and successful history. For example, Johnson et al. [JPA68] describes the use of FSA s to implement lexical analyzers. More recently, Proebsting and Fraser [PF94] and Muller [Mul93] have used finite state automata to model and detect structural hazards in pipelines for instruction scheduling. 7 Summary Current methods of procedure call specification ....

Johnson, W.L., J.H. Porter, S.I. Ackley, and D.T. Ross. Automatic generation of efficient lexical processors using finite state techniques, Communications of the ACM, 11:(12), 805-813.

....of regular languages. In 1968, Thompson described the use of regular expressions for searching text [22] Thompson s algorithm reports each point in the target text where a match ends. In the same year, a group at MIT used regular languages for automatically constructing lexical analyzers [18]. This system used the longest match rule to resolve simple cases of matching ambiguity and reported errors in others. A number of variants of Thompson s algorithm are described by Aho, Hopcroft and Ullman [5] The algorithm described in section 3.2 of this paper is a extension of one of the ....

Walter L. Johnson, James H. Porter, Stephanie I. Ackley, and Douglas T. Ross. Automatic generation of efficient lexical processors using finite state techniques. Communications of the ACM, 11(12):805--813, December 1968.

....from the LALR grammars of the programming languages. GLA [8] does not address the lookahead problem; backtracking is not allowed. Rex [7] uses a tunnel automaton for efficient scanner generation. It does not address the look ahead problem. Traditionally, scanners generated from regular expressions [10] are slower than one carefully coded by hand. However, Waite [18] reports that new scanner generators can produce scanners that are as fast as hand coded scanners. GLA [8] and Mkscan [9] do not support the full set of regular expressions. They aim at handling only those tokens that are used in ....

Johnson, W.L., Porter, J.H., Ackley, S.I., and Ross, D.T., Automatic generation of efficient lexical processors using finite state techniques, Comm. ACM 11(12) pp. 305-313 (November 1968).

No context found.

W. L. Johnson, J. H. Porter, S. I. Ackley, and D. T. Ross. Automatic generation of efficient lexical processors using finite state techniques. Communications of the ACM, 11(12):805--813, 1968.

No context found.

W. L. Johnson, J. H. Porter, S. J. Ackley and D. T. Ross, `Automatic generation of efficient lexical processors using finite state techniques', Comm. of the ACM, 12, 805--813 (1968).

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