(answer all please)
QUESTION 51 For the following given empty stack PDA where is the start state and is the initial stack symbol (0, a, X. push(X). O) (0, 1, X, pop, 1) (1.b, X, pop, 1) What is a correct grammar constructed from the PDA? OAS-> Sb|A B.S -> Sb a OCS->bSaA OD.S ->aSbb QUESTION 52
QUESTION 52 1 point When transforming the following grammar to Grelbach normal form, do we need to remove the A-production? S aSb IT TTIA True False QUESTION 53 1 pc Given the following inductive definition of set S, which one is S? Basis: A. yes Induction: Ifs = or head(s) = x then xxs S else yys € S ОА {л, х, у, жух, уху, хуxух, ухуху, ..., (хуу"х, ухуу"...} OB. 14, xx,yy, XXXK, yyyy,..., 21.,2...) ос. (л, x, y, xx, уу, ххх, ууу, ... ...xy...) OD. (1, y, xx, yyy, XXXX, Yyyyy....,x2n, 2n+1...)
QUESTION 54 Which of the following is a correct inductive definition for set S - (<1>, <2,1,3,2,1..? O A Basis: <1> is in s Induction: If I is in S, then (headl) 1:is in S. 8. Basis: <1> is in S. Induction: If I is in S, then head(): is in S. OC Basis: <O> is in S Induction: If I is in S, then head(): is in S. D. Basis: <O> is in S. Induction: If I is in S, then (head{1+1) is in S QUESTION 55 Given the following grammar G with I as the start symbol 1 - AAB В - c| CB ALID C - LIDIS
QUESTION 55 1 paints Given the following grammar G with I as the start symbol 1+ AAB в с 1 CB A-LID CLIDIS D-0111213141516171819 Lalblodolf SISI @1# the following is a parse tree for string 71. One node is missing. What in the missing node? OAA ов. В OCD SEATS Click Save and submit to save and submir. Click Save All Anses to see all amster
1 - AAB B + CCB ALID CLIDIS D-0111213141516171819 L-albicidolf SIS@ the following is a parse tree for string 71. One node is missing. What is the missing node? А 7 -- ОА А OBB OCD ODC
uc QUESTION 56 1 poi Closure is a necessary part of an inductive definition True False poi QUESTION 57 Given the following grammar G with I as the start symbol 1 AAB Всі се ALID CLIDIS D-0111213141516171819 La bicidio SI$@13 Which of the following is a terminal of G? OAC OB. OCCB 0.1 Serbit to see and submit. Click Save All Aros olles
QUESTION 58 1 points Given the alphabet A = {xy), and an inductive definition for the sets of all strings over Athat alternate the X's and y's. For example, the strings A. X. X. Xyx, xy, yxyx and yx are in S. But yy and xxyy are not. The inductive definition is incomplete in two places. Choose one of the given options to complete it correctly. Basis: AES Induction: Ifs - then xy S else if head(s)x then ES else es OAXSys ОВ, sy, sx OCys, xs OD.SK, sy 1 points QUESTION 59
Question Completion Status: QUESTION 59 + Given the following function that involve lists: f(x, <ab....an>) - 20+ ax + a2x2...+ anx its recursive definition is given as follows. What is the missing part of this recursive definition? f(x, h::t) = if => then h else where hat represents a list with head h and tailt. O A + f(x, t)x O B. (h+ f(x, t)) Och + f(x, t) OD.h+tx
Question Completion Status: QUESTION 60 Given the following grammar G with I as the start symbol 1 - AAB B CCB ALID CLIDIS D-0111213141516171819 La bicidelt S - $1@1# Which of the following is a non-terminal of G? OAI O B. CB OCO OD.
QUESTION 51 For the following given empty stack PDA where is the start state and is the initial stack symbol (0, a, X. p
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
QUESTION 51 For the following given empty stack PDA where is the start state and is the initial stack symbol (0, a, X. p
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!