Q. Syntax Analyser takes Groups Tokens of source Program into Grammatical Production

View solution

Q. From where it take its input from?

View solution

Q. Parsers are expected to parse the whole code

View solution

Q. Which of these features of assembler are Machine-Dependent

View solution

Q. A compiler can check?

View solution

Q. The fourth Generation computer was made up of?

View solution

Q. Select a Machine Independent phase of the compiler

View solution

Q. Which of the following system software resides in the main memory always

View solution

Q. Output file of Lex is _____ the input file is Myfile?

View solution

Q. Suppose One of the Operand is String and other is Integer then it does not throw error as it only checks whether there are two operands associated with ‘+’ or not .

View solution

Q. In Short Syntax Analysis Generates Parse Tree

View solution

Q. Assume the statements S1 and S2 given as:
S1: Given a context free grammar, there exists an algorithm for determining whether L (G) is infinite.

S2: There exists an algorithm to determine whether two context free grammars generate the same language.

Which of the following is true?

View solution

Q. If P & R are regular and also given that if PQ=R, then

View solution

Q. Consider the grammar given below E? E+E | E*E | E-E | E/E | E^E | (E) | id Assume that + and ^ have the same but least precedence, * and / have the next higher precedence but the same precedence and finally ^ has the highest precedence. Assume + and ^ associate to the left like * and / and that ^ associates to the right. Choose the correct for the ordered pairs (^,^) , (-,-) , (+,+) , (*,*) in the operator precedence table constructed for the grammar

View solution

Q. Given the following statements:
(i) Recursive enumerable sets are closed under complementation.
(ii) Recursive sets are closed under complements.

Which is/are the correct statements?

View solution

Q. Assume statements S1 and S2 defined as: S1: L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turing machines is countable. Which of the following is true?

View solution

Q. A regular Grammar is a?

View solution

Q. Which of these does not belong to CFG

View solution

Q. How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?

View solution

Q. Give a production grammar that specified language L = {ai b2i >= 1}

View solution