In this question how to transforming the grammar into a Q-grammar, and build the corresponding parse table.

E-STE F-, (E) la Q-grammars a CFG G- (V, T, P, S) is a Q-grammar iff I. the rhs of each production is eithere, or begins with a terminal symbol 2. productions with the same lhs have disjoint SELECT sets Q-grammars, an example S-b For rules of the formA -bar ba)-{b} SELECTA SO SELECT( S-aAS)- (a) SELECT(S-b)- {b) SELECT(A- cAS)- c) .For rules of the form Ae SELECT(A ) = FOLLOW( A) = FIRST( S)