CIT342
1. ____ is a form of analytic grammar designed for linguistics
Language Machine
Top-Down Parsing Language
Link Grammars
Parsing Expression Grammars
2. A context-free language can be recognized in ____ time
O (n3)
O (n2)
O (n)
none of the options
3. ____ grammars increase the expressiveness of conventional generative grammars by allowing rewrite rules to operate on parse trees instead of just strings
Affix grammars and
Tree-adjoining
Attribute grammars
Link grammars
4. Parsing expression grammars (PEGs) is a more recent generalization of _____ designed around the practical expressiveness needs of programming language and compiler writers
Parsing Expression Grammars
Language Machine
Link Grammars
Top-Down Parsing Language
5. Noam Chomsky first formalized generative grammars in _____
1956
1965
1966
1856
6. The _____ directly implements unrestricted analytic grammars
Language Machine
Top-Down Parsing Language
Link Grammars
Parsing Expression Grammars
7. whic of the following is one of the two important types of grammars?
context-free grammar
context-sentive grammars
denumerable grammars
none of the options
8. Which of the following is an example of analytic grammar formalisms?
the language machine
top-down parsing language
link grammars
all of the options
9. Which of the following statements is not true of regular grammars?
the left hand side is only a single nonterminal symbol
the right-hand side is not restricted
the right side may be the empty string
all of the options
10. _____ is a highly minimalist analytic grammar formalism developed in the early 1970s
Link Grammars
Top-Down Parsing Language
Language Machine
Parsing Expression Grammars
JOIN OUR TELEGRAM ON VIP NOUN UPDATES – FOR FREE CIT342 PAST QUESTIONS AND EXAMS SUMMARIES
