1.Write a grammar that generates strings that contain matched brackets and paren

Q: 1.Write a grammar that generates strings that contain matched brackets and paren

1. -> | [ ] | { } | ( ) | NULL 2. Valid: baab, bbbaaaaab, Invalid: bbbab, aabab, bbbaaabb The grammar generates strings which begin with a sequence of 1 or more 'b', followed by a sequence of 2 or more 'a', further followed by a 'b'

ID: 645404 • Letter: 1

Question

1.Write a grammar that generates strings that contain matched brackets and parentheses. Examples of valid strings are:

Examples of invalid strings are:

2. Given the following grammar:

<sentence> -> <left> a <right> b
<left> -> <left> b | b
<right> -> a <right> | a

Indicate which of the following strings are valid according to this grammar. For those that are valid, construct the parse tree.

baab

bbbaaaaab

bbbab

aabab

bbbaaabb

In English, describe the strings generated by this grammar as specifically as possible.

Explanation / Answer

<start> -> <start> <start> | [ <start> ] | { <start> } | ( <start> ) | NULL

Valid:
baab, bbbaaaaab,

Invalid:
bbbab, aabab, bbbaaabb

The grammar generates strings which begin with a sequence of 1 or more 'b', followed by a sequence of 2 or more 'a', further followed by a 'b'

Navigate

1.Write a function that takes inputs of quarts and pints (whole numbers), then c

1.Write a method using Java syntax that takes a reference ‘r’ to the root of a b

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

1.Write a grammar that generates strings that contain matched brackets and paren

Question

Explanation / Answer

Related Questions

Navigate