Finite State Machines (FSM)
The
study of syntax in computer science is the study of the rules that
govern how statements are put together. Some examples of
syntax
rules (from various languages) are:
- all statements must end with a semicolon
- all variables must start with an alphabetic character
- every left paren must be followed by a unique right paren
Grouped
together, the syntax rules describe a particular language. A
finite state machine (FSM) can be used to check strings of symbols and
determine whether or not they belong in a particular language.
In
simple terms, if the FSM can generate a particular string, then that
string is a valid construct in that language. For more
information on finite state machines, see the links below: