mee 105

In a finite-state grammar as “registering” the sequence, what model programmed to emit symbols as it passes from state to state?

• Input model

• Output model

• Inductive model

• Deductive model

in the scheme S1-S6, how many intermediate states are there to cater for the different ranges of choices?

• one

• two

• three

• six

The following are the capacities of rewrite-rule grammar, Except?

• to have a rule generating more than one terminal symbol

• to have a rule generating purely non-terminal symbols

• to have a rule rewriting two (or more) symbols at a time.

• a set of rules relating all the symbols

It considers grammar as a system of rules that generates exactly those combinations of words that form grammatical sentences in a given language

• Finite-state grammar

• Generative grammar

• Rewrite grammar

• Grammar

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

• Finite-state grammar

• Rewrite grammar

• Generative grammar

• grammar

The whole series of strings from initial symbol through to terminal string is termed?

• SUBSTITUTION

• CONSTRUCTION

• DERIVATION.

• OMISSION

For the grammar (Z-A+B), what is the initial symbol?

• A

• Z

• B

• Z-A+B

Which noun word works with the determiner "much"?

• milk

• pens

• book

• glasses