The INDIA lexic generator. Since the generated scanners in compiler construction are (still) not very efficient, the authors try to replace the old fashion of compiler components by a modified view: the compiler consists of a set (actually, a sequence) of abstract machines associated by tables which contain the abstract instruction codes to control the work. The INDIA compiler generator is based on such a conception: the lexical and syntactic analyses are done by coupling a lexical machine with a syntactical machine (the second one using LR(1) or LALR(1) grammar mechanisms). Results for Modula-2 lexic, minimal perfect hash function, basic operations for a deterministic finite automaton interpreter are contained.
References in zbMATH (referenced in 1 article , 1 standard article )
Showing result 1 of 1.