Robert W. Gray, `#--GLA: A generator for lexical analyzers that programmers can use', in Proceedings of the Summer 1988 USENIX Conference, pp. 21--24, San Francisco, (June 1988).  Home/Search   Document Not in Database   Summary   Related Articles

....include: A MODEL AND TOOLSET FOR THE UNIFORM TAGGING OF ENCODED DOCUMENTS 75 (1) installing the string that represents an identifier into the symbol table and (2) notifying the parser that an identifier has been found. These actions can easily be automatically generated. For example, 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 ....

....example, 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 ....

Robert W. Gray, `#--GLA: A generator for lexical analyzers that programmers can use', in Proceedings of the Summer 1988 USENIX Conference, pp. 21--24, San Francisco, (June 1988).

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