0
$\begingroup$

Can a CFG parse tree have a root other than starting non-terminal S? Except for the cases when tree has a height equal to zero and contains only one symbol from the main alphabet.

Improve this question
$\endgroup$
1
  • $\begingroup$ Short answer: no. (As if a tree could have a root other than a root.) $\endgroup$
    – user16034
    May 29 at 11:29

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.