Let S be a start symbol and S -> aA, A -> BA, A -> a, B -> b be the productions in a grammar then one of the string derived form the grammar is _____.

Related MCQs

• If S is a start symbol and S -> AB, A -> aB, B -> b are the productions then a string generated by the grammar is _______.
• If "S -> aS, S -> a" are the productions in a grammar G, then the grammar is called_____.
• The statement, “At least one of your friends is perfect”. Let P (x) be “x is perfect” and let F (x) be “x is your friend” and let the domain be all people.
• If all the productions have single non-terminal in the left hand side then the grammar defined is ________grammar.
• Let K be a group with 8 elements. Let H be a subgroup of K and H<K. It is known that the size of H is at least 3. The size of H is
• Context free grammar is also known as _______ grammar.
• Let f : ( - 1, 1 ) → B be a function defined by f ( x ) = 2 1 x 1 2x tan - - , then f is both one-one and onto when B is the interval
• Let the statement be “If n is not an odd integer then square of n is not odd.”, then if P(n) is “n is an not an odd integer” and Q(n) is “(square of n) is not odd.” For direct proof we should prove                    
• Let p: Mohan is rich, q : Mohan is happy, then the statement: Mohan is rich, but Mohan is not happy in symbolic form is
• Let p: I will get a job, q: I pass the exam, then the statement form: I will get a job only if I pass the exam, in symbolic from is