Midterm 4 Practice Questions

11 flashcards · Other · by Logan Pollack

1. Let L(G) be the language of all strings consisting of zero or more a’s

2. Let L(G) be the set of strings consisting of one or more a’s with a comma between each a and the next.

3. Let L(G) be the set of all strings consisting of one or more digits 0 – 9

4. Given: Write the parse tree for the expression "a + b"

5. Is the following grammar ambiguous?

   Yes, you can make multiple parse trees

6. Is the following grammar ambiguous?

   Yes

7. Is the following grammar ambiguous?

   No

9. Let L(G) be the set of all strings that start with an a followed by zero or more b’s and end with the character c. Design grammar G.

10. Given the following grammar Q: Q: <A>* ::= <A> @ <A> | * What are some of the strings in L(Q)?

11. Given: Do the following statements belong to this grammar? s = 1 + 2 * 3 s = (1 + 2) * 3 s = a + 3