On the applicability of the longest-match rule in lexical analysis.
From MaRDI portal
Publication:1872687
DOI10.1016/S0096-0551(02)00014-0zbMath1038.68032WikidataQ56113301 ScholiaQ56113301MaRDI QIDQ1872687
Wuu Yang, J.-T. Chan, Chey-Woei Tsay
Publication date: 14 May 2003
Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)
Mealy automaton; Moore automaton; Compiler; Context-free grammar; Regular expression; Finite-state automaton; Lexical analyzer; Parser; Scanner
68N20: Theory of compilers and interpreters
Uses Software
Cites Work