If all the productions have single non-terminal in the left hand side then the grammar defined is ________grammar.

Related MCQs

• 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 _____.
• If "S -> aS, S -> a" are the productions in a grammar G, then the grammar is called_____.
• If S is a start symbol and S -> AB, A -> aB, B -> b are the productions then a string generated by the grammar is _______.
• Context free grammar is also known as _______ grammar.
• In a get-together party, every person present shakes the hand of every other person. If there were 90 handshakes in all, how many persons were present at the party?
• Inversion of single bit input to a single bit output using                    
• A partial order ≤ is defined on the set S = {x, b1, b2, … bn, y} as x ≤ bi for all i and bi ≤ y for all i, where n ≥ 1. The number of total orders on the set S which contain the partial order ≤ is              
• In a graph if few edges have directions and few do not have directions then the graph is called _________.
• At a software company, skilled workers have been hired for a project. Out of 75 candidates, 48 of them were software engineer; 35 of them were hardware engineer; 42 of them were network engineer; 18 of them had skills in all three jobs and all of them had skills in at least one of these jobs. How many candidates were hired who were skilled in exactly 2 jobs?
• S -> aAB, AB -> bB, B -> b, A -> aB satisfies ___________ type of grammar