Levels of Grammar and Grammatical Analysis-Types of Syntax [GATE (Graduate Aptitude Test in Engineering) Linguistics]: Questions 1 - 2 of 2

Access detailed explanations (illustrated with images and videos) to 49 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 100.00 -OR-

How to register? Already Subscribed?

Question 1

Appeared in Year: 2021

Question MCQ▾

Multiple select Question (MSQ) , carry Two mark each (no negative marks) .

Figure Shows What is Called a Finite State Machine

The above figure shows what is called a finite state machine. The machine reads one word at a time and transitions to a new state. The states are indicated by boxes and the transitions by arrows. There are three states and and the last is the final state (indicated by two coincident boxes) . The text beside each arrow means the following: determiner (a, an, the) , adjective, noun. The machine starts at and on seeing a determiner (DT) enters the state . Then if it sees an adjective , it remains in the same state. But at state if it sees a noun , it enters the final state. The final state is also called the “accept” state. No other states or state transitions are defined or permitted.

Which of the following will cause the machine to enter , the accept state?

Choices

Choice (4)Response

a.

The blue sky

b.

The sky

c.

A very blue sky

d.

A vast blue sky

Edit

Question 2

Appeared in Year: 2021

Question MCQ▾

Multiple Choice Question (MCQ) , carry Two mark each (for each wrong answer: )

Consider the sentence “Little children marched past the church song” . Assume the starting rule of the contact free grammar describing the language to be , where S is the start symbol, NP is the noun phrase and VP is the verb phrase. For the given sentence, how many words does VP contain?

Choices

Choice (4)Response

a.

Four

b.

One

c.

Three

d.

Two

Edit