Q1: It involves the following algorithm:

1. Arrange the non-terminal symbols in order: A₁, A₂, A₃, ..., A_n
2. For i=1 to n do:
    For j=1 to i-1 do:
     I) replace each production of the form A_i->A_jY with the productions: A_i->Z₁Y|Z₂Y|...|Z_kY where A_j->Z₁|Z₂|...|Z_k are all the current productions of A_j.
     II) Eliminate the immediate left recursion among the A_i

Q2: It involves the following algorithm:
 1. For each non-terminal A, find the longest prefix, say a, common to two or more of its alternatives
 2. if (a!=epsilon) then replace all the A productions, A->ab₁|ab₂|ab₃|...|ab_n|Z, where Z is anything that does not begin with a, with A->aY|Z and Y->b₁|b₂|b₃|...|b_n
 Repeat the above until no common prefixes remain.

Q3: It involves the basic DFS, where we expand each production and try to find a match. BFS has also been implemented.