Give an EBNF grammar for each of the languages below. Use the EBNF extensions wh

Question

Give an EBNF grammar for each of the languages below. Use the EBNF extensions wherever possible to simplify the grammars. In particular, you should eliminate explicit recursion from the grammars wherever possible. Don't forget to put single quotes around and EBNF metasymbol when using it as a token.
<S> :: = ab <S> | <empty>

i. The set of all strings consisting of an open bracket (the symbol followed by a list of one or more digits separated by commas, followed by a closing bracket (the symbol k. The set of all strings consisting of zero or more as, with a comma between each an and the next. (There should be no comma before the first or after the last.) l. The set of all strings consisting of an open bracket (the symbol C) followed by a list of zero or more digits separated by commas, followed by a closing bracket (the symbol

Explanation / Answer

a) S : = ' [ '+ D * + ' ] '

D : = '0'|'1'|'2'|'3'|'4'|'5'|'6'|'7'|'8'|'9'

b)S := D (' , ' D )*

D := '0'|'1'|'2'|'3'|'4'|'5'|'6'|'7'|'8'|'9'

c) S := '[ ' + D (' , ' D)* ' ] '

D = '0'|'1'|'2'|'3'|'4'|'5'|'6'|'7'|'8'|'9'

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.