On the look-ahead problem in lexical analysis

DOI10.1007/BF01213079zbMath0829.68018MaRDI QIDQ1899099

Wuu Yang

Publication date: 4 October 1995

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

deterministic finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of programming languages (68N15)

Related Items (1)

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

Uses Software

• Modula
• Flex

Cites Work

• Conflict detection and resolution in a lexical analyzer generator
• Efficient string matching
• Fast Pattern Matching in Strings
• Automatic generation of efficient lexical processors using finite state techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the look-ahead problem in lexical analysis