GROWTH DEVELOPMENT CHILD
CHOMSKY LANGUAGE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Finite state grammars
|
|
|
Infinite state grammars
|
|
|
Phrase structure grammars
|
|
|
transformational grammars
|
Detailed explanation-1: -A finite state language is a finite or infinite set of strings (sentences) of symbols (words) generated by a finite set of rules (the grammar), where each rule specifies the state of the system in which it can be applied, the symbol which is generated, and the state of the system after the rule is applied.
Detailed explanation-2: -Theories of grammar, grammatical analyses, and grammatical statements may be divided into three types: structural, formal, and functional.
Detailed explanation-3: -The following are the earliest theories of grammar: Traditional Grammar, Structural Grammar, Transformational Grammar /Transformational Generative Grammar and Systemic Functional Grammar.
Detailed explanation-4: -Unambiguous grammar is the grammar that doesn’t have ambiguity i.e. does not have more than one left or rightmost derivation for an input string. Hence, language generated by the regular grammar is accepted by the finite state machines.