GROWTH DEVELOPMENT CHILD
CHOMSKY LANGUAGE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
syntax parsing.
|
|
|
tokenising.
|
|
|
recognising e-mail addresses.
|
|
|
semantic parsing.
|
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: -Describing context-free grammars These are rules that, when applied, can generate all possible legal phrases in the language. Parsing Expression Grammar (PEG)-describes a CFG in terms of recognition rules. These are rules that can be used to match valid phrases in the language.
Detailed explanation-3: -A context-free grammar (CFG) is a certain type of formal grammar, which is a set of production rules that describe all possible strings in a given formal language. CFG is used to specify the syntax of a language. Terminals: Components of tokens output by the lexical analyzer.
Detailed explanation-4: -Therefore, this phase uses context-free grammar (CFG), which is recognized by push-down automata. It implies that every Regular Grammar is also context-free, but there exists some problems, which are beyond the scope of Regular Grammar. CFG is a helpful tool in describing the syntax of programming languages.