A fast method of lexical analysis

MaRDI QIDQ5930882zbMATH OpenFDO

Authors V. M. Kurochkin

Publication date 26 April 2001

Published in Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

lexical analysistable automaton

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1696587
• scientific article; zbMATH DE number 1542833
• On the look-ahead problem in lexical analysis
• A new analysis of LALR formalisms
• On the applicability of the longest-match rule in lexical analysis.

Cited in

(6)

• On the applicability of the longest-match rule in lexical analysis.
• On the look-ahead problem in lexical analysis
• scientific article; zbMATH DE number 1696587 (Why is no real title available?)
• scientific article; zbMATH DE number 1542833 (Why is no real title available?)
• scientific article; zbMATH DE number 2088055 (Why is no real title available?)
• Quick lexicographic sorting

This page was built for publication: A fast method of lexical analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5930882)