CSC 4101 : Practice Final
Document Summary
Scan the whole exam rst (there are a total of 7 pages) and plan your time. You have 1 hour, 50 minutes to complete all ve questions. The exam is open book, open notes, and closed neighbors. | lbrack rbrack de nes a subset of java expressions. E. g. , it allows expressions of the form a. b. c[1]. x[2]. y. z[3][4][5] (a) (5 pts) What are the problems (if any) with this grammar that might prevent us writing a recursive descent parser for this grammar. (b) (5 pts) Rewrite so it can be parsed with a recursive descent parser. Rewrite so it can be parsed with a recursive descent parser assuming that is a terminal symbol. If yes, provide an input string that can be parsed in more than one way. We have seen that different languages require different run-time data structures for representing activation records of functions. For the following languages, state which implementation mechanisms you need.
