Homework Answers
Add Answer to:
Ambiguous Grammars Question 3 [10 points be an ambiguous context-free grammar. We know that the l...
Given the following ambiguous context free grammar (3x20) 1. (a) Explain why the grammar is ambiguous...
Given the following ambiguous context free grammar (3x20) 1. (a) Explain why the grammar is ambiguous (b) Find an equivalent unambiguous context-free grammar. (c) Give the unique leftmost derivation and derivation tree for the string s generated from the unambiguous grammar above. 2. Construct non-deterministic pushdown automata to accept the following language (20) 3. Convert the following CFG into an cquivalent CFG in Chomsky Normal Form (CNF) (20)-
Problem 3. f10 points for each of the following context-free grammars, i)use set notation to define...
Problem 3. f10 points for each of the following context-free grammars, i)use set notation to define the language generated by the grammar, and ii) Show that it is ambiguous by drawing 2 different parse trees for a string. a) Grammar: S + SaSb Si S + Sja | SibT T + Tb Tac b) Grammar: S + 151 T T + 1X1 X X + 0X01
Q1: Given the below language and context free gramma:, a. Show that the grammar is ambiguous...
Q1: Given the below language and context free gramma:, a. Show that the grammar is ambiguous using the string ( abc) by using substitutions. b. Then design a push down automata that recognizes the language. C. Then show the tracing of (abc, abbccc) using the push down automata. d. Then Show which two simple languages create the greaterlanguage. Give set builder notation for each language. e. Then produce Chomsky normal form for the grammar. The following context-free language is inherently...
2. (10 points) Use the pumping lemma for context free grammars to show the following languages...
2. (10 points) Use the pumping lemma for context free grammars
to show the following languages are not context-free.
(a) (5 points)
.
(b) (5 points)
L = {w ◦ Reverse(w) ◦ w | w ∈ {0,1}∗}.
I free grammar for this language L. lemma for context free grammars to show t 1. {OʻPOT<)} L = {w • Reverse(w) w we {0,1}*). DA+hattha follaurino lano
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,...
Q6: (15 points) Give context-free grammar that generate the following language. a) abick ij,k 20 and...
Q6: (15 points) Give context-free grammar that generate the following language. a) abick ij,k 20 and i 2j +k} b) {w E 0,1' | the length of w is even, started by 1 and ended 01}
Q6: (15 points) Give context-free grammar that generate the following language. a) abick ij,k 20 and i 2j +k} b) {w E 0,1' | the length of w is even, started by 1 and ended 01}
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,...
Construct context-free grammars that generate each of these languages: A. tw E 10, 1 l w...
Construct context-free grammars that generate each of these languages: A. tw E 10, 1 l w contains at least three 1s B. Hw E 10, 1 the length of w is odd and the middle symbol is 0 C. f0, 1 L fx l x xR (x is not a palindrome) m n. F. w E ta, b)* w has twice as many b's as a s G. a b ch 1, J, k20, and 1 or i k
3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa...
3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa Give a leftmost derivation for the string. 3 points) (4 poiots) (5 points) (3 points) sECTION IWOLAttcmpt.any 3.(or 2) questions from this.scction Suppose we have two tokens: (1) the keyword if, and (2) id-entifiers, which are strings of letters other than if. Show the DFA for these tokens. Give a nightmost derivation for the string. Give a parse tree for the string i) Is...
Which part of this program is used for input one context free grammar? And if you...
Which part of this program is used for input one context free
grammar? And if you want to give another different context free
grammar, how to do that?
code:
#include<stdio.h>
#include<stdlib.h> #include<string.h>
#define MaxVtNum 20
#define MaxVnNum 20
#define MaxPLength 20
#define MaxSTLength 50
char stack[20]={'#','E'};
char input[MaxSTLength];
char termin[MaxVtNum]={'i','+','*','(',')','#'}; char
non_termin[MaxVnNum]={'E','G','T','H','F'};
struct product{
char left;
char right[MaxPLength];
int length;
};
struct product E,T,G,G1,H,H1,F,F1;
struct product M[MaxVnNum][MaxVtNum];
int flag=1;
int top=1;
int l;
void print_stack(){
}
}
}
}
}...
Given the following ambiguous context free grammar (3x20) 1. (a) Explain why the grammar is ambiguous (b) Find an equivalent unambiguous context-free grammar. (c) Give the unique leftmost derivation and derivation tree for the string s generated from the unambiguous grammar above. 2. Construct non-deterministic pushdown automata to accept the following language (20) 3. Convert the following CFG into an cquivalent CFG in Chomsky Normal Form (CNF) (20)-
Problem 3. f10 points for each of the following context-free grammars, i)use set notation to define the language generated by the grammar, and ii) Show that it is ambiguous by drawing 2 different parse trees for a string. a) Grammar: S + SaSb Si S + Sja | SibT T + Tb Tac b) Grammar: S + 151 T T + 1X1 X X + 0X01
Q1: Given the below language and context free gramma:, a. Show that the grammar is ambiguous using the string ( abc) by using substitutions. b. Then design a push down automata that recognizes the language. C. Then show the tracing of (abc, abbccc) using the push down automata. d. Then Show which two simple languages create the greaterlanguage. Give set builder notation for each language. e. Then produce Chomsky normal form for the grammar. The following context-free language is inherently...
2. (10 points) Use the pumping lemma for context free grammars
to show the following languages are not context-free.
(a) (5 points)
.
(b) (5 points)
L = {w ◦ Reverse(w) ◦ w | w ∈ {0,1}∗}.
I free grammar for this language L. lemma for context free grammars to show t 1. {OʻPOT<)} L = {w • Reverse(w) w we {0,1}*). DA+hattha follaurino lano
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,...
Q6: (15 points) Give context-free grammar that generate the following language. a) abick ij,k 20 and i 2j +k} b) {w E 0,1' | the length of w is even, started by 1 and ended 01}
Q6: (15 points) Give context-free grammar that generate the following language. a) abick ij,k 20 and i 2j +k} b) {w E 0,1' | the length of w is even, started by 1 and ended 01}
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,...
Construct context-free grammars that generate each of these languages: A. tw E 10, 1 l w contains at least three 1s B. Hw E 10, 1 the length of w is odd and the middle symbol is 0 C. f0, 1 L fx l x xR (x is not a palindrome) m n. F. w E ta, b)* w has twice as many b's as a s G. a b ch 1, J, k20, and 1 or i k
3 points) Question Three Consider the context-free grammar S >SS+1 SS 1a and the string aa Give a leftmost derivation for the string. 3 points) (4 poiots) (5 points) (3 points) sECTION IWOLAttcmpt.any 3.(or 2) questions from this.scction Suppose we have two tokens: (1) the keyword if, and (2) id-entifiers, which are strings of letters other than if. Show the DFA for these tokens. Give a nightmost derivation for the string. Give a parse tree for the string i) Is...
Which part of this program is used for input one context free
grammar? And if you want to give another different context free
grammar, how to do that?
code:
#include<stdio.h>
#include<stdlib.h> #include<string.h>
#define MaxVtNum 20
#define MaxVnNum 20
#define MaxPLength 20
#define MaxSTLength 50
char stack[20]={'#','E'};
char input[MaxSTLength];
char termin[MaxVtNum]={'i','+','*','(',')','#'}; char
non_termin[MaxVnNum]={'E','G','T','H','F'};
struct product{
char left;
char right[MaxPLength];
int length;
};
struct product E,T,G,G1,H,H1,F,F1;
struct product M[MaxVnNum][MaxVtNum];
int flag=1;
int top=1;
int l;
void print_stack(){
}
}
}
}
}...
Most questions answered within 3 hours.
-
Briefly describe an aspect of the strengths perspective that is
consistent with your own understanding of...
asked 51 seconds from now -
Step by step method of using Sparse Identification of Nonlinear
Dynamics (SINDy) to model your own...
asked 7 minutes ago -
3) What are the typical social structures in a global city?
asked 3 hours ago -
Luther Corporation
Consolidated Balance Sheet
December 31, 2019 and 2018 (in $ millions)
Assets
2019
2018...
asked 3 hours ago -
(Expected rate of return and risk) Carter Inc. is evaluating a
security. Calculate the investment’s expected...
asked 5 hours ago -
What specific indicators can point to lack of progress for
African Americans in American society?
asked 6 hours ago -
1-The Electrons in a beam are moving at 2.7×108 m/s in an
electric field of 15000...
asked 7 hours ago -
A gas tank is a vertical cylinder. It has a radius of 1m, a
height of...
asked 7 hours ago -
Accent Software faces the following conditions. All of these
support Accent’s use of a market-penetration pricing...
asked 8 hours ago -
A mathematically inclined friend emails you the following
instructions: "Meet me in the cafeteria the first...
asked 8 hours ago -
A monopoly sells in two countries . The demand curves in the two
countries are p1...
asked 9 hours ago -
A .15kg rubber ball is bounced off a wall. Before hitting the
wall, the ball moves...
asked 10 hours ago