3 votes 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 asked Jul 20, 2020 Sanjay Sharma 2.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply Hradesh patel commented Jul 20, 2020 reply Follow Share Answer is Unrestricted grammar. 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes The answer should be B) Unrestricted Grammar Sherrinford03 answered Jul 21, 2020 Sherrinford03 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 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 See all 8 8 Comments reply Show 5 previous comments wafer commented Aug 1, 2020 reply Follow Share Yes, In CFG we can have S-> epsilon as well. 0 votes 0 votes gatecse commented Aug 1, 2020 reply Follow Share 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 votes 1 votes wafer commented Aug 2, 2020 reply Follow Share Ok, it is CFG 0 votes 0 votes Please log in or register to add a comment.
