Vital Statistics

Grammar
A →	A ( B A )
\|	.
B →	B ( A B )
\|	.

Some sentences generated by this grammar: {ε, ( ), ( ) ( ), ( ( ) ), ( *( )* ), ( ) ( ( ) ), ( ( ) ( ) ), ( ( ( ) ) ), ( ( ) ) ( ), ( ) ( ) ( ), ( ) ( *( )* ), ( *( ( ) )* ), ( ( *( )* ) ), ( *( )* ) ( ), ( *( )* ( ) ), ( *( *( )* )* ), ( *( )* *( )* ), ( ( ( ( ) ) ) ), ( ) ( ( ( ) ) ), ( *( )* ( ( ) ) )}

All nonterminals are reachable and realizable.
The nullable nonterminals are: A B.
The endable nonterminals are: A.
No cycles.

nonterminal	first set	follow set	nullable	endable
A	(	( ) ( ) $	yes	yes
B	*(	( ) ( )	yes	no

The grammar is not LL(1) because:

A is nullable with clashing first and follow sets.
A is left recursive.
B is nullable with clashing first and follow sets.
B is left recursive.

check to see if certain sentences are in the language
attempt to transform the grammar (to LL(1))
generate LL(1) parsing table
generate LR(0)/SLR(1) automaton
generate LALR(1) automaton
generate LR(1) automaton

Return home to enter a new grammar.