Fill out the table described in the polynomial time
Chapter , Problem 7.4(choose chapter or problem)
Fill out the table described in the polynomial time algorithm for context-free language recognition from Theorem 7.16 for string w = baba and CFG G:S RT R TR | a T TR | b
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer