On the applicability of the longest-match rule in lexical analysis. (Q1872687)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the applicability of the longest-match rule in lexical analysis. |
scientific article; zbMATH DE number 1910811
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the applicability of the longest-match rule in lexical analysis. |
scientific article; zbMATH DE number 1910811 |
Statements
On the applicability of the longest-match rule in lexical analysis. (English)
0 references
14 May 2003
0 references
Compiler
0 references
Context-free grammar
0 references
Finite-state automaton
0 references
Lexical analyzer
0 references
Mealy automaton
0 references
Moore automaton
0 references
Parser
0 references
Regular expression
0 references
Scanner
0 references
0 references
0.80623907
0 references
0.80129176
0 references
0.79541963
0 references
0.7884306
0 references
0.78521967
0 references
0.7797304
0 references
