Grammars, LL, Recursive descent and LR Parsers.

A brief introduction and discussion about parsers, grammers and compiler generators.

A grammar is a 4-tuple defined as Non terminals, terminals, a start symbol, and a set of productions.
G(N, T, S, P)

LL (scan from the left and build a left tree), LR (scan from the left and build a right tree). Recursive descent (A hand built LL parser).

Productions will be Chomsky type 3 for regular expressions, and type 2 (context free) for computer languages.