Autori: Dan Popa

Editorial: UNIVERSITATEA DIN BACĂU STUDII ŞI CERCETĂRI ŞTIINŢIFICE Seria: MATEMATICĂ, 2005, p.113-121, 2005.

Rezumat:

Abstract: In this paper the author explains how the adaptive DFA based on
array of sets was discovered, despite the fact that DFA and the theory of lexical
analysis are considered closed domains for decades. The paper is introducing a
data structure which is able to store together different automata. They are
remaining able to work together but everyone uses its own way (i.e. path
between states). Applications comes from the field of compiler construction.
But other tools, subject of the future papers, may also be written using this
technique. It is able to reduce the time needed to release a new compiler
because it allows one part of it (which makes lexical analysis) to re-build itself
every time when a compiler author needs.

Cuvinte cheie: adaptiv, automate, automate adaptive, analiza lexicala // adaptive, automata, adaptive automata

URL: http://www.haskell.org/sitewiki/images/c/ce/AdaptiveDFA-Bc_%28copy%29-pg113.pdf