A regular Grammar is a

1.	A regular Grammar is a
A.	CFG
B.	Non CFG
C.	English Grammar
D.	None of the mentioned
Answer» B. Non CFG

Discussion

No Comment Found

Related MCQs

In the context of compilers, which of the following is/are NOT an intermediate representation of the source program?
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it:(P)Syntax tree(i)Code generator(Q)Character steam(ii)Syntax analyzer(R)Intermediate representation(iii)Semantic analyser(S)Token stream(iv)Lexical analyzer
Consider the basic block given below.a = b + cc = a + dd = b + ce = d - ba = e + bThe minimum number of nodes and edges present in the DAG representation of the above basic block respectively are
Consider the intermediate code given below.1) i = 12) j = 13) t1 = 5 ∗ i4) t2 = t1 + j5) t3 = 4 ∗ t26) t4 = t37) a[t4] = - 18) j = j + 19) if j < = 5 goto (3)10) i = i + 111) if i < 5 goto (2)The number of nodes and edges in the control - flow - graph constructed for the above code, respectively, are
Generation of intermediate code based on an abstract machine model is useful in compilers because:
A variable x is said to be live at a statement Si in a program if the following three conditions hold simultaneously:i. There exists a statement Sj that uses xii. There is a path from Si to Sj in the flow graph corresponding to the programiii. The path has no intervening assignment to x including at Si and SjThe variables which are live both at the statement in basic block 2 and at the statement in basic block 3 of the above control flow graph are
Consider the following intermediate program in three address code:p = a – bq = p * cp = u * vq = p + qWhich one of the following corresponds to a static single assignment form of the above code?
Which of these does not belong to CFG?
A CFG is closed under
A regular Grammar is a

A regular Grammar is a

Discussion

No Comment Found

Related MCQs

Reply to Comment