Syllabus:
Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.
Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.
Regular Languages :
In simple terms , languages generated by regular-grammar are regular languages.
If you don't know what are regular grammar, here is quick review of chomsky classification:
Symobols:
A = Non-Terminals.
(a) = Anything (non terminals or terminals or their combo. or can be null if not specified..)
a = terminals.
L = Left context.
R = Right context.
Type-0 : kuch bhi , matlab kuch bhi.
Type-1 :
LAR -> L(a)R ,
where (a) != null here.
I will explain the meanings soon.
(I will use the latex later :P)
Type-2 :
A -> (a)
Type-3 :
A -> a , A -> aB
Type-3 is also called
Regular grammar.