Test

BNF Quiz

Amy Dang 4 preguntas

Hacer el test

Este test tiene tipos de pregunta que se abren en el reproductor de siempre.

Preguntas del test (4)

1Define a grammar for the empty language, which is a language containing no strings. (There is no valid sentence in the empty language.)
1. Aempty ->
2Define a grammar for the letter language. A letter is a lower-case Latin letter between a and z.
1. A<letter> -> <a> | <b>| <c> | ... |<z>|
3Define 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.
1. A<word> -> <letter> |<word> <letter>
4Define 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: ())(, (, )(, )(((((((((.
1. A<paren> -> (<paren>) <paren> | <empty>

Descripción: Test your knowledge on BNF and EBNF
Autor: Amy Dang
Idioma: English
Visitas: 61
Etiquetas: bnf ambiguous parse trees csci 374: programming languages chapter 3: describing syntax and semantics college
Valoración: Aún sin valoraciones
Valora este test
Valora este test