The process of finding the derivation of the word generated by particular grammar is called
- AProcessing
- BParsing
- CProgramming
- DPlanning
Finding a derivation (parse tree) of a word in a grammar is called parsing.
MCQs, short and long questions from lecture 44.Lecture 44 ki MCQs, short aur long sawal.
6 MCQs · 2 short · 1 long question · 6 MCQs from past papers6 MCQs · 2 short · 1 long sawal · 6 MCQs past papers se
The process of finding the derivation of the word generated by particular grammar is called
Finding a derivation (parse tree) of a word in a grammar is called parsing.
Chomsky normal form (CYK) algorithm was proposed by ________ .
The CYK algorithm is named after Cocke, Younger and Kasami; John Cocke is the C.
The process of finding the derivation of word generated by particular grammar is called :
Finding a derivation is parsing.
CYK algorithm was invented by John Cocke and later was published by ____
The CYK algorithm is named after Cocke, Younger and Kasami; Tadao Kasami and Daniel H. Younger published it.
There are different parsing techniques, including ________
Top-down, bottom-up and the technique for arithmetic expression grammars are all parsing techniques.
CYK algorithm was invented by John Cocke and later was published by ____
The CYK algorithm is named after Cocke, Younger and Kasami; it was later published by Tadao Kasami and Daniel H. Younger.
No MCQs match this filter.Is filter mein koi MCQ nahi.
How you differentiate between wanted and unwanted branches while deriving a string from in the context of CFG?
In top-down parsing we grow the derivation tree from S. A branch whose working string can still derive the target word (its terminal prefix matches and its length does not exceed the word) is wanted; a branch that can no longer produce the word is unwanted and is cut off.
Write three different parsing techniques.
1) Top-down parsing: start from the start symbol and apply productions to try to derive the given word (for example by building the derivation tree from the root). 2) Bottom-up parsing: start from the word and replace right-hand sides by their left-hand nonterminals until only the start symbol remains. 3) The CYK algorithm: for a grammar in CNF, fill a table of the nonterminals that generate every substring of the word, and accept if the start symbol generates the whole word.
Parsing Techniques
Parsing means finding a derivation (tree) of a given word from a CFG. Top-down parsing starts from the start symbol and expands productions, discarding branches that cannot lead to the word; bottom-up parsing starts from the word and reduces substrings to nonterminals until the start symbol is reached. The ambiguous grammar S → S+S | S*S | number gives two values for 3+4*5 (23 or 35); the unambiguous PLUS-TIMES grammar S → E, E → T+E | T, T → F*T | F, F → (E) | i gives * priority over +. Derivation of i+i*i: S ⇒ E ⇒ T+E ⇒ F+E ⇒ i+E ⇒ i+T ⇒ i+F*T ⇒ i+i*T ⇒ i+i*F ⇒ i+i*i.