I have the following Grammar:
D → T ∨ D | T
T → C ∧ T | C
C → ¬ C | name | ( D )
name → a | b | c | d
and i need to make a parse tree for the following formula:
I'm a little stuck on how to approach this. Any help would be much appreciated.
Parse Tree Question - Help Required!! Watch
- Thread Starter
- 22-07-2014 11:36
- 23-07-2014 12:10
While you're waiting for an answer, did you know we have 300,000 study resources that could answer your question in TSR's Learn together section?
We have everything from Teacher Marked Essays to Mindmaps and Quizzes to help you with your work. Take a look around.
If you're stuck on how to get started, try creating some resources. It's free to do and can help breakdown tough topics into manageable chunks. Get creating now.
Not sure what all of this is about? Head here to find out more.