MCQOPTIONS
Saved Bookmarks
| 1. |
Which of the following machine model can be used in a necessary and sufficient sense for lexical analysis in modern computer language? |
| A. | Deterministic Push down Automata |
| B. | Finite Automata |
| C. | Non-Deterministic Finite Automata |
| D. | Turning Machine |
| Answer» C. Non-Deterministic Finite Automata | |