| Class | Description |
|---|---|
| Automata |
Automata : a finite state machine
is made of a set of States among which a set of final States and an initial state,
a set of Labels, the transition relation is a set of (outgoing)transitions going from the states abd reaching other states.
|
| State |
State of a finite state machine:
it has a name, and
a list of outgoing transitions ; each transition is labelled by a symbol
|
| Symbol |
Symbol : a symbol is used as a label of an FSM's transition.
|
| syntaxChecking |
syntaxChecking : this application
- builds an adhoc automata, set a symbil list to be analysed, and
- parses the list according to the automata
|