I want to know question number 11.

I would be grateful if you could help me with the details. I am really confused about this assignment. And please don't copy other answers to here.

10. Here is a nondeterministic finite automaton with epsilon-transitions: Suppose we use subset construction to convert this epsilon-NFA to a deterministic finite automaton with a dead state, with all transitions defined, and with no state that is inaccessible from the start state. Which of the following would be a transition of the DFA? (5) Note: we use S-x->T to say that the DFA has a transition on input x from state S to state T. {A,B}1{A}{B,C,D}2{B,C,D}{A,B}1{A,B}{A,B,C}3{C,D}{B,C,D}2{B,C} 11. Use the following C function f to answer the question int(intx,py,ppz)fppz+=3;pY+=5;x+=7;returnx+(py)+(ppz); Suppose there are variables a,b, and c external to f as follows: a is a pointer to b;b is a pointer to c, and c is an integer with current value 8 . If we call f(c,b,a), what is returned by f ? Describe the difference between a lexeme and a token. What does the A in DFA denote and what is a DFA? Why should compiler phases be kept separate? What does the gcc preprocessor do? What benefit is it to know that an NFA has an equivalent, although probably larger, DFA? How might multi-threaded processing be considered non-deterministic? How many threads are needed for processing to no longer be considered deterministic? What is the benefit of using an interpreter over a compiler? For the following lex specification, what rules will never apply and why