
418 Appendix A
7. Grammar G3 = < {V, S, R, N}, {+, −, ., d, #}, V, P >
P = { 1. V -> SR#
2. S -> +
3. S -> -
4. S -> e
5. R -> .dN
6. R -> dN.N
7. N -> dN
8. N -> e
}
What language does the grammar generate? What kind of language is it?
A.4 Regular Languages, Regular Expressions and Finite-state
Machine
Regular languages (RL) are specified by a Regular Expression (RE), a Regular Grammar (RG) or
indirectly by its acceptor, a Finite-state Machine (FSM).
A.4.1 Regular Languages
Three basic set operations of union, intersection and closure are used to define a new language from an
existing one. If we start with a finite vocabulary V
T
and ...