Grosch, J. Efficient generation of lexical analysers. Software--Practice and Experience 19, 11 (1989), 1089--1103. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
RE2C - A More Versatile Scanner Generator - Bumbulis, Cowan (1994) (1 citation) (Correct)
....a mechanically generated scanner. One commonly cited reason for not using LEX generated scanners is performance: they can be 10 times slower than equivalent hand coded scanners [13] As a result, there has been considerable research into improving the performance of mechanically generated scanners [16, 7, 9]. GLA [7] one such scanner generator, can produce scanners that are faster than most hand coded scanners. However, the use of hand coded scanners is still prevalent. One possibility is that this is due to the difficulty of adapting the generated scanners to specific applications. Most scanner ....
....the generated scanners to specific applications. Most scanner generators are tailored to a particular environment. In fact, the trend in recent years has been to integrate scanner generators with compiler toolkits. For example, GLA is part of the Eli compiler construction system [8] and Rex [9] is part of the GMD Toolbox for Compiler Construction 1 . Scanners Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date ....
[Article contains additional citation context not shown here]
Grosch, J. Efficient generation of lexical analysers. Software--Practice and Experience 19, 11 (1989), 1089--1103.
On the Look-Ahead Problem in Lexical Analysis - Wuu Yang (1995) (Correct)
....no tokens will be printed. The variable token is assigned the value action [4] which is T7. Then the SFA attempts to make state transition from state 7 on input a . However, the SFA still cannot proceed. Therefore, the token in the variable token T7 is printed. The SFA jumps to continuation [7], which is state 1. The variable token is assigned the value action [7] which is NULL . Then the SFA attempts to make state transition from state 1 on input a . This time the SFA can change to state 2. The next input symbol is end of f ile ; the SFA will print the token associated with state 2 ....
....[4] which is T7. Then the SFA attempts to make state transition from state 7 on input a . However, the SFA still cannot proceed. Therefore, the token in the variable token T7 is printed. The SFA jumps to continuation [7] which is state 1. The variable token is assigned the value action [7], which is NULL . Then the SFA attempts to make state transition from state 1 on input a . This time the SFA can change to state 2. The next input symbol is end of f ile ; the SFA will print the token associated with state 2 and jump to continuation [2] which is the initial state. Finally, the ....
[Article contains additional citation context not shown here]
Grosch, J., Efficient generation of lexical analysers, Software---Practice and Experience 19(11) pp. 1089-1103 (November 1989).
Mealy Machines Are A Better Model Of Lexical Analyzers - Yang (1996) (Correct)
....and employs special LookAheadStates to solve the problem. Nawrocki [14] solves a problem similar to that of Alex and LexAGen by checking the left context derived from the LALR grammars of the programming languages. GLA [15] does not address the look ahead problem; backtracking is not allowed. Rex [16] which uses a tunnel automaton for efficient scanner generation, does not address the look ahead problem. GLA [15] and Mkscan [17] do not support the full set of regular expressions. They aim at handling only those tokens that are used in common programming languages. LexAGen [13] provides a ....
J. Grosch, Efficient generation of lexical analysers, Software---Practice and Experience 19(11) pp. 1089-1103 (November 1989).
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