Homework Answers
Given, string is: ababbac
Using 1st grammar:
A -> abBc
-> ababbAc [using B -> abbA]
-> ababbac [using A -> a]
Derivation Tree is:
Using 2nd grammar:
A -> ababbAc
-> ababbac [using A -> a]
The derivation tree is:
Add Answer to:
AUTOMATA THEORY
1 using G=({A, B3, {a,b, c3, A, p) P: A al aca Al abBC...
1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the...
1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the string aabbbb using the grammar. (b) Give an English description of the language generated by the grammar 2. Let G be the grammar below: S-ASB ab | SS (a) Show that G is ambiguous. (b) Construct an unambiguous grammar equivalent to G. 3. Find a context free grammar for the language L3- fa"b"c+m :n,m21) 4. Find a context free grammar for the language L4...
1. Construct a DFSM to accept the language: L w E ab): w contains at least 3 as and no more than 3 bs) 2. Let E (acgt a...
1. Construct a DFSM to accept the language: L w E ab): w contains at least 3 as and no more than 3 bs) 2. Let E (acgt and let L be the language of strings consisting of repeated copies of the pairs at, ta, cg. ge. Construct both a DFSM to accept the language and a regular expression that represents the language. 3. Let ab. For a string w E , let w denote the string w with the...
(3) Consider the grammar G=(V.T.E.P) with V={E,1). T={a,b,c,++,() ), and productions EI, EE+E, EE+E, E (E),...
(3) Consider the grammar G=(V.T.E.P) with V={E,1). T={a,b,c,++,() ), and productions EI, EE+E, EE+E, E (E), I=abc. (1) Show that G is ambiguous by giving two different derivation trees for string b+c+a (ii) Change the above grammar into the one without ambiguity.
Name: 25 Game Theory ECN 416 FOSTER Score: Assignm ent #1: Introduction to Choice Theory Use...
Name: 25 Game Theory ECN 416 FOSTER Score: Assignm ent #1: Introduction to Choice Theory Use a pencil. Put your answer in the appropriate place and box it. Show any work necessary to ensure partial credit. Staple these pages. 1) Draw the following probability distribution, (z), in tree form and state its expected value (3 pts) p(0)=0.15 (40)0.45 P(75)0.40 : EV(z) = 2) Draw the following probability distribution, (z'), in tree form and state its expected value (3 pts) z'...
Please help me with the coding for LL(1)!! The given grammar was: P → PL |...
Please help me with the coding for LL(1)!!
The given grammar was:
P → PL | L
L → N; | M; | C
N → print E
M → print "W"
W → TW | ε
C → if E {P} | if E {P} else {P}
E → (EOE) | V (note: this has a variable O)
O → + | - | * V → 0 | 1 | 2 | 3 (note: this has a terminal...
Set Theory and Conditional Probability Problem #1 : (10pts) If P(A) 0.3 and P(B)0.2 and P(A...
Set Theory and Conditional Probability Problem #1 : (10pts) If P(A) 0.3 and P(B)0.2 and P(A n B) - 0.1. Determine the following probabilities Problem #2: (10pts) a) If the sets Xand Yare non-mutually exclusive , show that: b) Given two events X and Y, draw a Venn diagram to demonstrate that P(X)- P(XnY) + P(XnY), and deduce that P(X)- P(X/Y)P(Y) + P(X/Y)P(Y). Problem #3: (15pts) Consider two events X and Y with probabilities, P(X) 7/15, P(XnY)-1/3, and P(X/Y)-2/3. Calculate...
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...
1. (a) What is the normalızation condition for the probability P(u) (b) Iffu) and g(u) are...
1. (a) What is the normalızation condition for the probability P(u) (b) Iffu) and g(u) are any two functions of u then, show that f(u)+ g(u)f(u)+g(u) (3) (c) Calculate the mean values for the random walk problem (t) Mean number for (a) nght and (b) left steps (u) Mean displacement (10) (3) (7) (1) Dispersion of the net Hint: displacement to the right N! w(n)n (N-n)p"qN where N is the total number of steps, n the number of steps to...
-question using php assume g=5, p=7, a=3, b=5, find the value of the shared secret key...
-question using php assume g=5, p=7, a=3, b=5, find the value of the shared secret key based on Diffie-Hellman.
please please help! Statically Indeterminate Propped Cantilevered Beam Reaction and Deflection Derivation 1. Determine the reactions...
please please help!
Statically Indeterminate Propped Cantilevered Beam Reaction and Deflection Derivation 1. Determine the reactions R4, Rg, and M, and the elastic equation for the section of the beam between the wall and the load P. 2. Note: It will take 3 solutions to solve for the elastic equations for the entire beam: 0<x<d, d<x<s, and s SXSL 1. The derivation of the elastic equation for the section between the wall and the load (0 <x<d) is derived above....
1. Consider the following grammar A - aB B-Sb (a) Show a derivation tree for the string aabbbb using the grammar. (b) Give an English description of the language generated by the grammar 2. Let G be the grammar below: S-ASB ab | SS (a) Show that G is ambiguous. (b) Construct an unambiguous grammar equivalent to G. 3. Find a context free grammar for the language L3- fa"b"c+m :n,m21) 4. Find a context free grammar for the language L4...
1. Construct a DFSM to accept the language: L w E ab): w contains at least 3 as and no more than 3 bs) 2. Let E (acgt and let L be the language of strings consisting of repeated copies of the pairs at, ta, cg. ge. Construct both a DFSM to accept the language and a regular expression that represents the language. 3. Let ab. For a string w E , let w denote the string w with the...
(3) Consider the grammar G=(V.T.E.P) with V={E,1). T={a,b,c,++,() ), and productions EI, EE+E, EE+E, E (E), I=abc. (1) Show that G is ambiguous by giving two different derivation trees for string b+c+a (ii) Change the above grammar into the one without ambiguity.
Name: 25 Game Theory ECN 416 FOSTER Score: Assignm ent #1: Introduction to Choice Theory Use a pencil. Put your answer in the appropriate place and box it. Show any work necessary to ensure partial credit. Staple these pages. 1) Draw the following probability distribution, (z), in tree form and state its expected value (3 pts) p(0)=0.15 (40)0.45 P(75)0.40 : EV(z) = 2) Draw the following probability distribution, (z'), in tree form and state its expected value (3 pts) z'...
Please help me with the coding for LL(1)!!
The given grammar was:
P → PL | L
L → N; | M; | C
N → print E
M → print "W"
W → TW | ε
C → if E {P} | if E {P} else {P}
E → (EOE) | V (note: this has a variable O)
O → + | - | * V → 0 | 1 | 2 | 3 (note: this has a terminal...
Set Theory and Conditional Probability Problem #1 : (10pts) If P(A) 0.3 and P(B)0.2 and P(A n B) - 0.1. Determine the following probabilities Problem #2: (10pts) a) If the sets Xand Yare non-mutually exclusive , show that: b) Given two events X and Y, draw a Venn diagram to demonstrate that P(X)- P(XnY) + P(XnY), and deduce that P(X)- P(X/Y)P(Y) + P(X/Y)P(Y). Problem #3: (15pts) Consider two events X and Y with probabilities, P(X) 7/15, P(XnY)-1/3, and P(X/Y)-2/3. Calculate...
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...
1. (a) What is the normalızation condition for the probability P(u) (b) Iffu) and g(u) are any two functions of u then, show that f(u)+ g(u)f(u)+g(u) (3) (c) Calculate the mean values for the random walk problem (t) Mean number for (a) nght and (b) left steps (u) Mean displacement (10) (3) (7) (1) Dispersion of the net Hint: displacement to the right N! w(n)n (N-n)p"qN where N is the total number of steps, n the number of steps to...
please please help!
Statically Indeterminate Propped Cantilevered Beam Reaction and Deflection Derivation 1. Determine the reactions R4, Rg, and M, and the elastic equation for the section of the beam between the wall and the load P. 2. Note: It will take 3 solutions to solve for the elastic equations for the entire beam: 0<x<d, d<x<s, and s SXSL 1. The derivation of the elastic equation for the section between the wall and the load (0 <x<d) is derived above....
Most questions answered within 3 hours.
-
S sells property with a $500 basis to B for $450, and B later
sells the...
asked 12 minutes ago -
On January 1, 20X7, Green Corp. paid $1,020,000 to acquire Wax
Co. Wax maintained separate incorporation....
asked 13 minutes ago -
C++
Write a class Fraction that defines adding, subtracting,
multiplying, and dividing fractions by overloading standard...
asked 1 hour ago -
This java code won't run and I can't figure out the problem with
it. Please help...
asked 2 hours ago -
Trace the following recursive methods:
a) isPal with the string “abccda”
b) isAnBn with the string...
asked 3 hours ago -
1. Which of the following is false about photosynthesis?
A. ATP is the molecule used to...
asked 4 hours ago -
A simple random sample of size n=64 is obtained from a
population with a mean of...
asked 5 hours ago -
(2 dimensions, 1 object, 2 accelerations)
1) A projectile is thrown with a wind. The wind...
asked 6 hours ago -
Brian makes $34,100 per year. How much can Brian expect to
contribute to FICA taxes in...
asked 6 hours ago -
To buy a new house you must borrow $155,000. To do this you take
out a...
asked 7 hours ago -
Spacely Sprockets is evaluating the construction of a new plant
on land the company purchased for...
asked 7 hours ago -
1. Consider a linear regression model of y on K regressors and
an intercept.
(i) Describe...
asked 7 hours ago