Write a EBNF grammar for the set of ALL (and ONLY) the strings that are made...
Write a EBNF grammar for the set of ALL (and ONLY) the strings that are made of 0 or more occurrences, in any order, of the letters a and/or b in which the total number of occurrences of the letter a is even. Your answer must use the EBNF extensions WHENEVER possible in order to minimize the number of non-terminals and productions.
Homework Answers
GRAMMAR
<expr> := '' | a <A> | b{<expr>}
<A> := a { <expr> } | b {<A>}
EXPLANATION
expr has even number of a's
A has odd number of a's
If b comes, staying at the same non-terminal.
Please up vote. Happy Learning!
Add Answer to:
Write a EBNF grammar for the set of ALL (and ONLY) the strings
that are made...
Write a context-free grammar for the language where all strings are of even length and the...
Write a context-free grammar for the language where all strings are of even length and the first half of the string is all 0’s, but it must be an odd number of 0’s
Design a regular grammar to generate the set of all even integers. Design a regular grammar...
Design a regular grammar to generate the set of all even integers. Design a regular grammar to generate the set of all odd integers. Design a regular grammar to generate the set of all integers beginning with the digit 8 such that the digits are consecutive and even. If a digit is 8, its following digit (if present) will be 0. The set of valid strings is {8, 80, 802,8024, 80246, 802468,...) Design a regular grammar to generate the set...
Construct context-free grammars that generate the given set of strings. If the grammar has more than one variable, we wi...
Construct context-free grammars that generate the given set of
strings. If the grammar has more than one variable, we will ask to
write a sentence describing what sets of strings expect each
variable in the grammar to generate. For example, if the grammar
was:
I could say "C generates binary strings of length one, E
generates (non-empty) even length binary strings, and O generates
odd length binary strings." It is also fine to use a regular
expression, rather than English,...
13.) Write a grammar for the language consisting of strings that have n copies of the...
13.) Write a grammar for the language consisting of strings that have n copies of the letter a followed by one more number of copies of the letter b, where n>0. For example, the strings abb, aaaabbbbb, and aaaaaaaabbbbbbbbb are in the language but a, ab, ba, and aaabb are not. Answer the aaaaaabbbbbbbh are in the languagebr 14.) Draw parse trees for the sentences abb and aabbb, as derived from the grammar of Problem 13. Answer:
For each of the following, construct context-free grammars that generate the given set of strings. If...
For each of the following, construct context-free grammars that generate the given set of strings. If your grammar has more than one variable, we will ask you to write a sentence describing what sets of strings you expect each variable in your grammar to generate. For example, if your grammar were: S → EO E → EE CC 0+ EC C+01 We would expect you to say “E generates (non-empty) even length binary strings; O generates odd length binary strings;...
Write a regular expression that captures the set of strings composed of 'a', 'b', and 'c',...
Write a regular expression that captures the set of strings composed of 'a', 'b', and 'c', where any string uses at most two of the three letters (for example, "abbab" is a valid string, or "bccbb", or "ccacaa", but not "abccba": strings that contain only one of the three letters are also fine). Give a non-deterministic finite automaton that captures the regular expression from Using the construction described in class, give a deterministic version of the automaton. Repeat the previous...
Construct context-free grammars that generate the given set of strings. If the grammar has more than one variable, we wi...
Construct context-free grammars that generate the given set of
strings. If the grammar has more than one variable, we will ask to
write a sentence describing what sets of strings expect each
variable in the grammar to generate. For example, if the grammar
was:
I could say "C generates binary strings of length one, E
generates (non-empty) even length binary strings, and O generates
odd length binary strings." It is also fine to use a regular
expression, rather than English,...
Write down the regular expressions for the following set of strings over {a, b}: 1.Strings that contain no more than one...
Write down the regular expressions for the following set of strings over {a, b}: 1.Strings that contain no more than one occurrence of the string aa. 2.All strings containing aba: 3.All strings of odd length 4.A string in this language must have at least two a's. 5.All strings that begin with a, and have an even number of b Bonus - All strings with “a” at every odd position
Rewrite Grammar with python Better pictures. this is only one question 2. Now we can begin on our LSystem clas...
Rewrite Grammar with python
Better pictures. this is only one question
2. Now we can begin on our LSystem class. First, we have to write a method that does the rewriting in the grammar. The idea here is that you start out with an axiom which is just a string. Then you apply rewrite rules, called productions, to expand some or all of the letters in the axiom to create a string, called a derived word. You can rewrite the...
2. 9 marks] Strings. Consider the following definitions on strings Let U be the set of all strings Let s be a str...
2. 9 marks] Strings. Consider the following definitions on strings Let U be the set of all strings Let s be a string. The length or size of a string, denoted Is, is the number of characters in s Let s be a string, and i e N such that 0 < ί < sl. We write s[i] to represent the character of s at index i, where indexing starts at 0 (so s 0] is the first character, and...
Design a regular grammar to generate the set of all even integers. Design a regular grammar to generate the set of all odd integers. Design a regular grammar to generate the set of all integers beginning with the digit 8 such that the digits are consecutive and even. If a digit is 8, its following digit (if present) will be 0. The set of valid strings is {8, 80, 802,8024, 80246, 802468,...) Design a regular grammar to generate the set...
Construct context-free grammars that generate the given set of
strings. If the grammar has more than one variable, we will ask to
write a sentence describing what sets of strings expect each
variable in the grammar to generate. For example, if the grammar
was:
I could say "C generates binary strings of length one, E
generates (non-empty) even length binary strings, and O generates
odd length binary strings." It is also fine to use a regular
expression, rather than English,...
13.) Write a grammar for the language consisting of strings that have n copies of the letter a followed by one more number of copies of the letter b, where n>0. For example, the strings abb, aaaabbbbb, and aaaaaaaabbbbbbbbb are in the language but a, ab, ba, and aaabb are not. Answer the aaaaaabbbbbbbh are in the languagebr 14.) Draw parse trees for the sentences abb and aabbb, as derived from the grammar of Problem 13. Answer:
For each of the following, construct context-free grammars that generate the given set of strings. If your grammar has more than one variable, we will ask you to write a sentence describing what sets of strings you expect each variable in your grammar to generate. For example, if your grammar were: S → EO E → EE CC 0+ EC C+01 We would expect you to say “E generates (non-empty) even length binary strings; O generates odd length binary strings;...
Write a regular expression that captures the set of strings composed of 'a', 'b', and 'c', where any string uses at most two of the three letters (for example, "abbab" is a valid string, or "bccbb", or "ccacaa", but not "abccba": strings that contain only one of the three letters are also fine). Give a non-deterministic finite automaton that captures the regular expression from Using the construction described in class, give a deterministic version of the automaton. Repeat the previous...
Construct context-free grammars that generate the given set of
strings. If the grammar has more than one variable, we will ask to
write a sentence describing what sets of strings expect each
variable in the grammar to generate. For example, if the grammar
was:
I could say "C generates binary strings of length one, E
generates (non-empty) even length binary strings, and O generates
odd length binary strings." It is also fine to use a regular
expression, rather than English,...
Rewrite Grammar with python
Better pictures. this is only one question
2. Now we can begin on our LSystem class. First, we have to write a method that does the rewriting in the grammar. The idea here is that you start out with an axiom which is just a string. Then you apply rewrite rules, called productions, to expand some or all of the letters in the axiom to create a string, called a derived word. You can rewrite the...
2. 9 marks] Strings. Consider the following definitions on strings Let U be the set of all strings Let s be a string. The length or size of a string, denoted Is, is the number of characters in s Let s be a string, and i e N such that 0 < ί < sl. We write s[i] to represent the character of s at index i, where indexing starts at 0 (so s 0] is the first character, and...
Most questions answered within 3 hours.
-
1. In the short run, the marginal product of labor increases
then decreases because of what?...
asked 10 minutes ago -
A farmer wants to compare the tastiness and juiciness of
tomatoes grown with three amounts of...
asked 1 hour ago -
What is facilitated diffusion and how does it differ from
symport and antiport transportation? How do...
asked 1 hour ago -
if a firm producing 100 units at $5.00 each experience
an 80% experience curve, what will...
asked 2 hours ago -
A solid, uniform disk of radius 0.250 m and mass 53.7 kg rolls
down a ramp...
asked 4 hours ago -
Given the following table of high speed internet access vs.
annual home income:
Home Income
%...
asked 5 hours ago -
A baseball batter hits a 0.145kg baseball straight up into the
air. The baseball leaves the...
asked 5 hours ago -
An FM modulator is tested using
single-tone baseband signal with frequency of 50kHz and a sprectrum...
asked 5 hours ago -
Write the ionic equations for the first stage of salts
hydrolysis.
Anion, Cation?
Na2S
NiSO4
K2SO4...
asked 7 hours ago -
suppose there is a normally distributed population with a mean of
250 and a standard deviation...
asked 8 hours ago -
Question Three
Suppose you as project manager are using the Waterfall
development methodology on a large...
asked 9 hours ago -
Which statement is not true about welfare in Canada?
A.Benefits typically vary based on one's ability...
asked 9 hours ago