MCQOPTIONS
Saved Bookmarks
| 1. |
For every context free grammar (G) there exists an algorithm that passes any w ? L (G) in number of steps proportional to |
| A. | ln|w| |
| B. | |w| |
| C. | |w|2 |
| D. | |w|3 |
| Answer» E. | |