38654627
Pregunta 1
Pregunta
Define a grammar for the empty language, which is a language containing no strings. (There is no valid sentence in the empty language.)
Image:
Blank (binary/octet-stream)
Respuesta
-
empty ->
Pregunta 2
Pregunta
Define a grammar for the letter language. A letter is a lower-case Latin letter between a and z.
Image:
Blank (binary/octet-stream)
Respuesta
-
<letter> -> <a> | <b>| <c> | ... |<z>|
Pregunta 3
Pregunta
Define a grammar for the word language. A word is a sequence of one or more letters. You may refer to the letter nonterminal defined above.
Image:
Blank (binary/octet-stream)
Respuesta
-
<word> -> <letter> |<word> <letter>
Pregunta 4
Pregunta
Define a grammar for the parenthesis language, where all sentences in the parenthesis language consist of balanced pairs of left and right parentheses. Example of valid pairs: (), (()), ()(), (((()())()())). Example of invalid pairs: ())(, (, )(, )(((((((((.
Image:
Blank (binary/octet-stream)
Respuesta
-
<paren> -> (<paren>) <paren> | <empty>
¿Quieres crear tus propios Tests gratis con GoConqr? Más información.