mee 105
Authored by melanie elumbaring
English
Professional Development
Used 8+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
8 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
in the scheme S1-S6, how many intermediate states are there to cater for the different ranges of choices?
one
two
three
six
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The whole series of strings from initial symbol through to terminal string is termed?
SUBSTITUTION
CONSTRUCTION
DERIVATION.
OMISSION
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
For the grammar (Z-A+B), what is the initial symbol?
A
Z
B
Z-A+B
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
Already have an account?
