Theoretical Aspects of Lexical Analysis/Exercise 17

From Wiki**3

< Theoretical Aspects of Lexical Analysis
Revision as of 17:26, 10 March 2013 by Root (talk | contribs) (Created page with "__NOTOC__ Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).<br/>The alphabet is Σ = {...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Compute the non-deterministic finite automaton (NFA) by using Thompson's algorithm. Compute the minimal deterministic finite automaton (DFA).
The alphabet is Σ = { a, b }. Indicate the number of processing steps for the given input string.

  • G = { a*, ba*, a*|b }, input string = aababb

NFA

The following is the result of applying Thompson's algorithm.

DFA

Determination table for the above NFA: Graphically, the DFA is represented as follows: The minimization tree is as follows. Note that before considering transition behavior, states are split according to the token they recognize.

Input Analysis

Retrieved from "https://www.hlt.inesc-id.pt/~david/wiki/pt/index.php?title=Theoretical_Aspects_of_Lexical_Analysis/Exercise_17&oldid=4273"