This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Thus, we still cannot pump. 3-ME91) A A S B , S B 4-ME92) For every entry, list the number of different NT you can make (or the same NT over again if you can make it multiple ways). The number of parse trees is the number of S in the bottom left. S B S T S B S,S T S T S B S,S,S,S,S T,T S,S T S T S...
View Full Document
- Spring '07
- Computer Science