BNF Quiz

Please wait - loading…

Question 1 of 4

Click on the orange point and write the correct answer.

Define a grammar for the empty language, which is a language containing no strings. (There is no valid sentence in the empty language.)

{"33.2475_23.8636":[{"id":56928565,"x":33.2475,"y":23.8636}]}

Explanation

Question 2 of 4

Click on the orange point and write the correct answer.

Define a grammar for the letter language. A letter is a lower-case Latin letter between a and z.

{"48.6328_46.2003":[{"id":56929018,"x":48.6328,"y":46.2003}]}

Explanation

Question 3 of 4

Click on the orange point and write the correct answer.

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.

{"51.527_47.7273":[{"id":56939785,"x":51.527,"y":47.7273}]}

Explanation

Question 4 of 4

Click on the orange point and write the correct answer.

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: ())(, (, )(, )(((((((((.

{"50.3906_48.2955":[{"id":56941635,"x":50.3906,"y":48.2955}]}

Explanation

To go back and change any of your answers, use the progress bar above or
jump back to the previous question.

Loading your results

As this is a preview, your results will not be submitted at this time.

Restart Preview

Check answer

["https://examtimeassets.s3.amazonaws.com/uploads/media/image/49242164/desktop_9afd5461-55bf-4ea6-af5c-63daf9d2c8b7.png","https://examtimeassets.s3.amazonaws.com/uploads/media/image/49242164/desktop_9afd5461-55bf-4ea6-af5c-63daf9d2c8b7.png","https://examtimeassets.s3.amazonaws.com/uploads/media/image/49242164/desktop_9afd5461-55bf-4ea6-af5c-63daf9d2c8b7.png","https://examtimeassets.s3.amazonaws.com/uploads/media/image/49242164/desktop_9afd5461-55bf-4ea6-af5c-63daf9d2c8b7.png"]

	Created by Amy Dang over 3 years ago

Test your knowledge on BNF and EBNF

BNF Quiz

Question 1 of 4

Click on the orange point and write the correct answer.

Define a grammar for the empty language, which is a language containing no strings. (There is no valid sentence in the empty language.)

Explanation

Question 2 of 4

Click on the orange point and write the correct answer.

Define a grammar for the letter language. A letter is a lower-case Latin letter between a and z.

Explanation

Question 3 of 4

Click on the orange point and write the correct answer.

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.

Explanation

Question 4 of 4

Click on the orange point and write the correct answer.

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: ())(, (, )(, )(((((((((.

Explanation