(a) What is FIRST(Es)?FOLLOW(E)?PREDICT(Es →)?
(b) Give a parse tree for the string(cdr ’(a b c)) $$.
(c) Show the left-most derivation of(cdr ’(a b c)) $$.
(d) Show a trace,inthestyleofFigure2.20,of atable-driventop-down parse of this same input.
(e) Now consider a recursive descent parser running on the same input. At the point where the quote token(’) is matched, which recursive descent routines will be active (i.e., what routines will have a frame on the parser’s run-time stack)?
đang được dịch, vui lòng đợi..
