Computer Science, asked by shewiyun, 3 months ago

Grammar: A -> B a | c B b | d C b | d C a B -> q | ê | A a C C -> f A C B | q A: Show that the given grammar is not suitable for CLR (1) but suitable for SLR (1) B: Now modify the grammar, so that it becomes suitable for CLR (1). Make sure that the modified grammar should results the same set of strings as the given grammar

Answers

Answered by Gurbhejsingh266
0

Answer:

sorry l don't know

Explanation:

sorry sorry

Similar questions