MEE 105 Activity

It is a grammar that is an abstract device but one that may be viewed as a kind of machine.

• Finite-state grammar

• Rewrite rule grammar

• Grammar

• Generative grammar

It is more powerful and more abstract than a finite-state grammar.

• Rewrite rule grammar

• Grammar

• Finite-state grammar

• Generative grammar

It is an abstract mathematical system that can provide clearly defined system.

• Turing machine

• Tuning machine

• Abstract machine

• Machine

It is the whole series of strings from initial symbol through terminal string.

• Derivation

• Recursive

• Initial state

• Final state

A rule that allows repeated application through having one symbol appearing on both left-hand and right hand.

• Derivation

• Recursive

• Initial State

• Final State

It claims to offer the only syntactic method of providing full explicitness

• Generative grammar

• Rewrite rule grammar

• Finite-state grammar

• Grammar

He suggests that the term generate is equally neutral.

• Wall

• Jespersen

• Harris

• Chomsky

He equate the term "GENERATE" to “PRODUCE” and contrast it with “RECOGNIZE” or “ACCEPT”

• Wall

• Jespersen

• Harris

• Chomsky

A text symbol "a" is also called ______

• Terminal symbol

• Non-terminal symbol

• Initial symbol

• State symbol

In rewrite rule grammar the state symbol is also called _________

• terminal symbol

• non-terminal symbol

• initial symbol

• final symbol