CHILD DEVELOPMENT PEDAGOGY

Detailed explanation-1: -A CFG only defines a language. It does not say how to determine whether a given string belongs to the language it defines. To do this, a parser can be used whose task is to map a string of words to its parse tree. The parse tree of course remains the same.

Detailed explanation-2: -Definition: A context-free grammar (CFG) is a list of rules that define the set of all well-formed sentences in a language. Each rule has a left-hand side, which identifies a syntactic category, and a right-hand side, which defines its alternative component parts, reading from left to right.

Detailed explanation-3: -Context Free Grammars (CFG) can be classified on the basis of following two properties: 1) Based on number of strings it generates. During Compilation, the parser uses the grammar of the language to make a parse tree(or derivation tree) out of the source code. The grammar used must be unambiguous.

Detailed explanation-4: -A context-free grammar is in Chomsky normal form if all of its rules obey the following constraints: The start variable does not appear on the right hand side of any rule. If a right hand side of a rule contains any variables, the right hand side contains exactly two variables.