Full metadata record
DC FieldValueLanguage
dc.contributor.authorYANG, Wen_US
dc.date.accessioned2014-12-08T15:03:15Z-
dc.date.available2014-12-08T15:03:15Z-
dc.date.issued1995-08-01en_US
dc.identifier.issn0001-5903en_US
dc.identifier.urihttp://dx.doi.org/10.1007/BF01213079en_US
dc.identifier.urihttp://hdl.handle.net/11536/1806-
dc.description.abstractModern programming languages use regular expressions to define valid tokens, Traditional lexical analyzers based on minimum deterministic finite automata for regular expressions cannot handle the look-ahead problem. The scanner writer needs to explicitly identify the look-ahead states and code the buffering and re-scanning operations by hand. We identify the class of finite look-ahead finite automata, which is general enough to include all finite automata of practical lexical analyzers, Finite look-ahead finite automata are then transformed into suffix finite automata. A new lexical analyzer makes use of the suffix finite automata to identify tokens. The new lexical analyzer solves the look-ahead problem in a table-driven approach and it can detect lexical errors at an earlier time than traditional lexical analyzers. The extra cost of the new lexical analyzers is the larger state transition table and three additional 1-dimensional tables. Incremental lexical analysis is also discussed.en_US
dc.language.isoen_USen_US
dc.titleON THE LOOK-AHEAD PROBLEM IN LEXICAL ANALYSISen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/BF01213079en_US
dc.identifier.journalACTA INFORMATICAen_US
dc.citation.volume32en_US
dc.citation.issue5en_US
dc.citation.spage459en_US
dc.citation.epage476en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:A1995RP45800002-
dc.citation.woscount4-
Appears in Collections:Articles