Designing a lexical analyzer

1. grammar given G( {(, ), ^, &, ~, a}, {S, R, T, G, E, F}, P, S)
P:
S->T | TR
R->^T|^TR
T->E | EG
G->&E | &EG
E-> ~E| F
F -> (S) | a
convert to grammar LL(1), build a recognizer based on the resulting grammar and perform a sequence analysis "a^a&~a&(a^~a)"
This is Program 1.

2. grammar given G( {"if","then","else", a, b }, {S,T,E,F}, P, S)
P:
S-> if b then T else S | if b then S | a
T-> if b then T else S | a
convert to grammar LL(1), build a recognizer based on the resulting grammar and perform a sequence parsing "if b then if b then if b then if b then a other a"";
interface to task 1 and 2:
1) the original grammar, 2) the automatic filling of the FIRST and FOLLOW table (after using left factorization), 3) the parsing table (stack, input, output (writes "pushing out" or applied generation from the parsing table) . eventually d.b. Admission or Reject.
This is Program 2.

The approximate int-s for the 1.2th task attached the file, but there should be spaces between the tokens

3. Also build (with this grammar in task 2) a simple precedence recognizer.
The interface is similar, but here you can either transfer or convolution.
This is Program 3.

all Delphi 7
Available code, with comments.
2 days...the price is fixed.