Every
grammar can be rewritten to LL(1) grammar. ( )
A: True
B: False
grammar can be rewritten to LL(1) grammar. ( )
A: True
B: False
举一反三
- Ambiguous<br/>grammar is not context free grammar.() A: True B: False
- Generally<br/>speaking, grammar can be divided into theoretical grammar and<br/>pedagogical grammar. Besides, there seems to be a shift from<br/>prescriptive grammar to descriptive grammar in terms of teaching<br/>grammar. ( <br/>)
- Among<br/>the four formal language grammars, type-1 grammar is also called ()<br/>grammar. A: Phrase structure grammar B: Context-free grammar C: Context-related grammar D: Regular grammar
- A<br/>grammar G, if (), is called LL (1) grammar. A: G<br/>contains no left recursion B: G<br/>has no ambiguity C: The LL (1) analysis table of G does not contain multiple definitions D: There is no left common factor in the production of G
- Grammar can be divided into four types: Type 0, type 1, type 2 and type 3. The type 3 grammar is ( ). A: Phrasal grammar B: Regular grammar C: Context-sensitive grammar D: Context-free grammar