|
|
|
Project: Implementation of FSA, RE and their transformation in AToM3
Abstract: Regular expression (RE) is used to define patterns of characters.
Finite State Automata (FSA) is a model which forms a scanning
process. It takes characters one-by-one from the input and
identify them with particular patterns which match up with a
regular expression. For every regular expression,
there exists a corresponding finite state automata that accepts
the language specified by the regular expression. Similarly, for
every finite state automata, there exists a regular expression
notation specifying L(M)(the language defined by the FSA
M). In this project, we study how to build the
modelling environment for RE and FSA in the meta-modelling tool
called AToM3, and how to implement their transformations in AToM3.
|
