Choose the correct option: Statement 1: Recursive Inference, using productions from head to body. Statement 2: Derivations, using productions from body to head.

Choose the correct option: Statement 1: Recursive Inference, using productions from head to body. Statement 2: Derivations, using productions from body to head. Correct Answer Statement 1 and Statement 2, both are false

Both statements are false. Recursive Inference, using productions from body to head. Derivations, using productions from head to body.
Bissoy MCQ

Related Questions

Statement: Left most derivations are lengthy as compared to Right most derivations. Choose the correct option:
Choose the correct option: Statement: There exists two inference approaches: Recursive Inference & Derivation
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?
Is the following statement correct? Statement: Recursive inference and derivation are equivalent.
Given Checklist: i) G has no useless symbols ii) G has no unit productions iii) G has no epsilon productions iv) Normal form for production is violated Is it possible for the grammar G to be in CNF with the following checklist?
Given Grammar: S->A, A->aA, A->e, B->bA Which among the following productions are Useless productions?
For the given grammar G: S->ABaC A->BC B->b| e C->D| e D-> d Remove the e productions and generate the number of productions from S in the modified or simplified grammar.
Given Grammar G: S->aA A->a| A B->B The number of productions to be removed immediately as Unit productions:
Given grammar G: S-> ABA, A->aA|e, B-> bB|e Eliminate e and unit productions. State the number of productions the starting variable holds?
Is the given statement correct? Statement: The mere existence of several derivations is not an issue, its is the existence of several parse trees that ruins a grammar.