{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

ps3-sol - ECE 468 Problem Set 3 Regular expressions Finite...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 468 Problem Set 3: Regular expressions, Finite Automata, Context-free Grammars, Parsers 1. Give the reduced DFA for the following regular expression: (( a * bcd ) | ( bc * d )) 2. For the following sub-problems, consider the following context-free grammar: S AB (1) A xAC (2) A λ (3) B CBy (4) B λ (5) C z (6) (a) What are the terminals and non-terminals of this language? Answer : V t = { x, yz } and V n = { S, A, B, C } (b) Describe the strings are generated by this language. Is this a regular language ( i.e. , could you write a regular expression that generates this language)? Answer: This language generates strings of the form x n z m + n y m . This is not regular because it requires a potentially unbounded amount of state to track how many n s and m s there are. (c) Show the derivation of the string xxzzzy starting from S (specify which produc- tion you used at each step), and give the parse tree according to that derivation. Answer: I will put a superscript on the production arrow ( ) to denote which production was used at each step.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}