Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

1.1k questions

1.2k answers

1.6k comments

546 users

0 votes
In task 4 e, you have to show that a word is not in the given grammar. Is it sufficient to give a non-terminable derivation tree? If not, how do you solve this task formally correctly?
in # Mandatory Modules Bachelor by (230 points)

1 Answer

+1 vote
This is one of the strengths of deterministic parsing. There is unique parse tree that is generated by the parse table for a LL or LR grammar regardless whether that word is accepted or not. The exam problem you are considering is asking for that derivation/parse tree, and the final result whether it was accepting or not.
by (166k points)

Related questions

Imprint | Privacy Policy
...