H. Mossenbock, `Alex---a simple and efficient scanner generator', SIGPLAN Notices, 21, 139--148 (1986).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in # GLA [28] a translation rule for identifier would be: A Za z] A Za z0 9] mkidn] where mkidn is a library routine that performs the appropriate processing for an identifier. Lexical analyzer generators that have been designed specifically for programming languages are # GLA [28] Alex [29], Mkscan [30] and LexAGen [31] These specialized lexical analyzer generators for programming languages will not meet our requirements for digital libraries. They are limited to understanding the set of token classes in the programming language domain. The domain of electronic documents has a ....

H. Mossenbock, `Alex -- a simple and efficient scanner generator', SIGPLAN Notices, 21(12), 139--148, (December 1986).

....generators, such as Lex [10] and Rex [4] treated these non regular constructs as exceptions to be handled outside of the syntax of the lexicon specification language, usually by requiring the user to write code in a standard programming language. Other lexical analyzer generators, such as Alex [11], GLA [15] and Mkscan [6] have made a move toward incorporating the non regular features into the syntax of the lexicon specification. Still others, have moved the entire lexical analysis process into the parser, thus specifying them with the same BNF rules as used for the rest of the language ....

H. Mossenbock. Alex -- a simple and efficient scanner generator. SIGPLAN Notices, 21(5):69--78, 1986.

....generators, such as Lex [10] and Rex [4] treated these non regular constructs as exceptions to be handled outside of the syntax of the lexicon specification language, usually by requiring the user to write code in a standard programming language. Other lexical analyzer generators, such as Alex [11], GLA [15] and Mkscan [6] have made a move toward incorporating the non regular features into the syntax of the lexicon specification. Still others, have moved the entire lexical analysis process into the parser, thus specifying them with the same BNF rules as used for the rest of the language ....

H. Mossenbock. Alex -- a simple and efficient scanner generator. SIGPLAN Notices, 21(5):69--78, 1986.

.... 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 in incremental systems. We will first discuss requirements, which result from the incremental environment and the structure of programming languages, ....

H. Mossenbock, 'Alex -- A Simple and Efficient Scanner Generator', SIGPLAN Notices, 21, 139--148, (1986).

....token definitions. By contrast, our approach solves the lookahead problem in a clean and automatic way. In TOOLS [12] backtracking is avoided by adding a new kind of token; it is similar to the error token approach. A user still needs to write code to handle the new 21 kind of token. Alex [14] introduces the if followed by operator to define the right context of a token. Instead of attacking the look ahead problem, this operator actually changes the longest match convention. Alex does not allow look ahead in the general sense. LexAGen [17] solves the look ahead problem in essentially ....

Mossenbock, H., Alex --- A simple and efficient scanner generator, ACM SIGPLAN Notices 21(5) pp. 69-78 (May 1986).

....states that are reachable from accepting states might be split. Lexical analyzers of most practical programming languages look ahead 1 or 2 characters. This means that only a few states are candidates for splitting. For a realistic example, consider the lexical analyzer of Modula 2 published in [9]. That lexical analyzer is an infinite lookahead automaton. After designating one state as a cutoff state, it becomes a generalized finite lookahead automaton. The numbers of states in the GFA, GSA, and CGSA are 48, 50, 52, respectively. A simple technique has been used to reduce the numbers of ....

....writer. In flex [11] a user introduces error token definitions to get rid of look ahead (called backtracking) A user still needs to write code to handle the new kind of token. In TOOLS [12] backtracking is avoided by adding a new kind of token; it is similar to the error token approach. Alex [9] introduces the if followed by operator. This operator actually changes the longest match convention. Alex does not allow look ahead in the general sense. LexAGen [13] which is similar to Alex, allows two character look ahead and employs special LookAheadStates to solve the problem. Nawrocki ....

H. Mossenbock, Alex --- A simple and efficient scanner generator, ACM SIGPLAN Notices 21(5) pp. 69-78 (May 1986).

No context found.

H. Mossenbock, `Alex---a simple and efficient scanner generator', SIGPLAN Notices, 21, 139--148 (1986).

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