What are the advantages of Non-deterministic Finite Automata over Deterministic Finite Automata?
What are the advantages of Non-deterministic Finite Automata over Deterministic Finite Automata?
2. As a student designing an arduino base project for your final year presentation:
(a) What must be the importance of optimizing your code?
(b) Explain 3 ways you can optimize your code.
(c) What is the difference between your code synthesis and code analysis.
3. Draw a parse tree for the string ddadddd using buttom-up and Top-down methods with the Context-Free Grammar below:
Q → dQbb | F
F → aF | ε
Write a regular expression to describe inputs over the alphabet {a, b, c}
i) that are in sorted order
ii) containing at least one a and at least one b
5. When does a stream of characters becomes tokens?
6. What are some advantages of High Language over Machine Language?
7. Explain the differences between synthesis phase of the compilation process and the analysis phase of the
compilation process?
8. What is the problem with a grammar that generates two different parse trees? Give an example.
9. a) Give one advantage of Assembler over Compiler and one disadvantage of High Level Language over
Assemble Language.
b) Give one advantage and one disadvantage of using an interpreter.
10. (a) why do we need parse tree.
(b) Differentiate between top-down and bottom-up parsing methods using a typical grammar.
11. Construct the NFA that will accept the string of (dc|ac)* dc (gg|bb)*dc.
Step by step
Solved in 2 steps
