On the applicability of the longest-match rule in lexical analysis.

DOI10.1016/S0096-0551(02)00014-0zbMath1038.68032WikidataQ56113301 ScholiaQ56113301MaRDI QIDQ1872687

J.-T. Chan, Wuu Yang, Chey-Woei Tsay

Publication date: 14 May 2003

Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)

zbMATH Keywords

Mealy automatonMoore automatonCompilerContext-free grammarRegular expressionFinite-state automatonLexical analyzerParserScanner

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Uses Software

• Modula

Cites Work

• On the look-ahead problem in lexical analysis
• Proving Properties of Programs by Structural Induction
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the applicability of the longest-match rule in lexical analysis.