3 3 votes Which of the following is not a monotonically increasing grammar? (A) Context-sensitive grammar (B) Unrestricted grammar (C) Regular grammar (D) Context-free grammar Theory of Computation bad-question + – Sanjay Sharma 3.1k views answer comment Share Follow Print See 1 comment 1 1 comment reply Hradesh patel commented Jul 20, 2020 reply Follow flag Answer is Unrestricted grammar. 0 0 replyShare Please log in or register to add a comment.
1 1 vote The answer should be B) Unrestricted Grammar Sherrinford03 answered Jul 21, 2020 Sherrinford03 comment Share Follow 0 reply Please log in or register to add a comment.
0 0 votes Suppose we have a grammar like α → β .where length of α is less than length of β ( |α |<=| β|).So, it is Unrestricted grammar. wafer answered Aug 1, 2020 • edited Aug 1, 2020 by wafer wafer comment Share Follow See all 8 Comments 8 8 Comments reply gatecse commented Aug 1, 2020 reply Follow flag What's the meaning of monotonically increasing grammar? 0 0 replyShare wafer commented Aug 1, 2020 reply Follow flag It will never stop and keep on growing.We can say that S-> epsilon will never occur 0 0 replyShare gatecse commented Aug 1, 2020 reply Follow flag So, is A-> Abc monotonically increasing? 0 0 replyShare wafer commented Aug 1, 2020 reply Follow flag yes 0 0 replyShare gatecse commented Aug 1, 2020 reply Follow flag That's a CFG rt? 1 1 replyShare wafer commented Aug 1, 2020 reply Follow flag Yes, In CFG we can have S-> epsilon as well. 0 0 replyShare gatecse commented Aug 1, 2020 reply Follow flag So S-> epsilon is not allowed in an unrestricted grammar? https://cs.stackexchange.com/questions/19609/why-isnt-every-monotonic-grammar-context-sensitive-free 1 1 replyShare wafer commented Aug 2, 2020 reply Follow flag Ok, it is CFG 0 0 replyShare Please log in or register to add a comment.
