代写CCBS4008 程序

日期：2024-02-27 09:07

1. (25pt) The identifiers in a programming language consist of one or more lower case letters, a, b,..., z, which must appear in non-decreasing alphabetical order. For example, correct identifiers include: accent, begin, x, zzz. Examples of incorrect identifiers are: bad, id.

2. (25pt) Consider the following grammar, G:

1. S ?! ABC 2. A ?! aA 3. A ?! "4. B ?! bB 5. B ?! bA 6. C ?! Cc 7. C ?! "

(c) (10pt) Modify G to become LL(1). Explain why the new, equivalent, grammar is LL(1). You don’t need to rebuild the first(), follow(), and predict() tables. Include su?cient explanation as to why the conflicts have been resolved.CS3342 – Midterm Exam – Wednesday, Mar. 1, 3:30 - 5:30pm 7

1. S ?! ABC 2. A ?! aA 3. A ?! "4. B ?! bB 5. B ?! bA 6. C ?! Cc 7. C ?! "

(c) (5pt) In general, in the definition of an SLR(1) grammar, shift/reduce and reduce/reduce conflict are forbidden. What about shift/shift conflicts?CS3342 – Midterm Exam – Wednesday, Mar. 1, 3:30 - 5:30pm 9

O ?! -

(b) (10pt) The same problem except that now you have to minimize the number of parentheses.

<span dir="LTR" yes';font-family:'arial="" unicode="" ms';mso-fareast-font-family:microsoftyahei;="" font-size:11.0000pt;"="">Alternative (c) (3pt) If you built a grammar for (a) but not for (b), then use the grammar you designed at (a). In this case, for a correct answer, you receive 3pt instead of 5pt. (If you solve the original (c), then you don’t have to do this.)