CIT445
Question: A set of rules of a specific kind for froming strings in a final language is called ____
Answer: formal grammar
Question: Type-0 grammars are also known as ____
Answer: unrestricted grammars
Question: Well-formed words are usually words that belongs to ____
Answer: formal language
Question: All languages generated by a regular grammar can be recognized in linear time by a ____
Answer: finite state machine
Question: Two words can be combined together to form a new word by means of ____
Answer: concatenation
Question: ____ is a set of sentence expression in a formal language
Answer: formal theory
Question: A part of compiler that constructs the desired target program from the intermediate representation is called ____
Answer: synthesis part
Question: A containment hierarchy of classes of formal grammars is called ____
Answer: The Chomsky hierarchy
Question: A grammar where left-hand side of each production rule consists of only a single non-terminal symbol is called ____
Answer: context-free grammar
Question: Strings generated by some formal grammar can be described as ____
Answer: language
For your Free Past Questions I Free Exams Summary I Free Past Tma Questions follow on Twitter
Whatsapp: 08039407882 for your Exam Summary I Online Tutorial I Projects Writeups I To become a Tutor
