+1-315-636-4485
+91 98151-74050 
This quiz contains multiple-choice problems on context-free grammar, inferences, ambiguity, sentential forms, application parser and YACC parser generators, trees derivations, markup languages and ambiguous grammar.
The recursive inference procedure determines that string w is in the language of the variable A, with A being the starting variable. True or false?
Which of the following are/is not (an) example(s) of context-free grammar?
Recursive inference
Derivations
Sentential forms
All of the above
Which of the following is a/are suitable approach(es) for inferencing?
Recursive inference
Derivations
Recursive inference and derivations
None of the above
A -> aA|a| b
The number of steps to form aab is
2
3
4
5
Figure out the number of incorrect notations or symbols whose change could correct the expression L(G) = {w in T*|S→*w}.
Zero errors
One error
Two error
Invalid expression
Recursive inference and derivation are equivalent. True or false?
Yes
No
troff and nroff are __ in UNIX.
Functions
Typesetting tools
System sofwares
None of the above
What does SGML stand for?
Which of the following have no use for markup languages?
Which of the following have XML as their default format?
XML is a/an __ markup language.
Meta
Beta
Octa
Peta
If w belongs to L(G), for some CFG, then it has a parse tree defining its own syntactic structure, thereby making it
A program
An SQL-query
An XML document
All of the above
