A method for designing a lexical analyzer
| dc.contributor.author | Gujar, Uday, G. | |
| dc.contributor.author | Dedurek, John, M. | |
| dc.contributor.author | McIntyre, Marion, E. | |
| dc.date.accessioned | 2023-03-01T18:27:52Z | |
| dc.date.available | 2023-03-01T18:27:52Z | |
| dc.date.issued | 1979 | |
| dc.description.abstract | The scanner is a subroutine which is frequently called by an application program like a compiler. The primary function of a scanner is to combine characters from the input stream into recognizable units called tokens. A method has been presented in this paper for designing such a scanner, also frequently referred to as a lexical analyzer in the current literature. The major steps involved in this design process are: identification of tokens, construction of a state diagram, building driver tables and finally writing a scanning routine. The rules for generating the driver tables are described and an algorithm for the scanner, utilizing these driver tables, is included. The method has been successfully used to build the system scanner for a user oriented plotting language. It is concluded that the method is well defined, gives rise to a modular design and as such easily lends itself to language extensions. | |
| dc.description.copyright | Copyright @ Uday G. Gujar, John M. Dedurek, and Marion E. McIntyre, 1979. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/14792 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | A method for designing a lexical analyzer | |
| dc.type | technical report |
Files
Original bundle
1 - 1 of 1