This file contains two questions. The first has 2 parts, the second has 7.

For all but questions 2.3 and 2.5 you'll answer questions by editing this file. Your answers will appear in the Ax.y section after each question, replacing the placeholders.

For question 2.3, you'll need to add an image file to the repository (.png or .pdf) and put its file name as the answer.

For question 2.5, you'll write one or more source code files and add them to the repository. You will then show the command used to run the files in the answer. Do not upload any binary files for this section.

Please do not edit anything outside the answers sections.

Mr Fussy wants to build a path using a row of large square pavers. His path is one paver wide and an odd number of pavers long. Pavers come in three colors: red, green, blue.

Mr Fussy has a rule: the sequence of colors must be symmetrical across the length of the path: the last paver must be the same color as the first, the second to last the same color as the second, and so on.

This is a valid path: rgbgr So is this: rrr

This is not: rgb This is not: rggr (it must be an odd length)

Write a Chomsky type 2 grammar that describes any valid path containing at least one paver. Use S as the start state, and r, g, b as terminals that represent the tiles.

S -> r | g | b
S -> r S r
S -> b S b
S -> g S g

Using big-O notation, what is the likely memory requirement for a parser that can validate a particular path configuration, where n is the number of tiles? In one sentence, explain why.

O(n). Because it should check if the configuration is an odd-length palindrome; one way to do it is using one pointer goes from left to right and one from right to left, they should meet at the center so we need n / 2 comparisions, which is O(n).

A simple sentence structure might be

"the" (zero or more adjectives) noun verb (optional adverb)

Adjectives are "lazy" or "smelly"

Nouns are "dog" or "cat"

Verbs are "ate" and "ran"

Adverbs are "slowly" and "noisily"

The following are examples of valid sentences:

• The smelly dog ran.
• The smelly dog ran slowly.
• The cat ate noisily.

Write the BNF (not EBNF) description for this language.

<sentence> ::= <the> <opt-adjective> <noun> <verb> <opt-adverb>

<the> ::= "the"
<adjective> ::= "smelly" | "lazy"
<opt-adjective> ::= <opt-adjective> <adjective> | ""
<noun> ::= "dog" | "cat"
<verb> ::= "ate" | "ran"
<opt-adverb> ::= "noisily" | "slowly" | ""

Write this grammar using EBNF with common extensions

<sentence> ::= <the> {<adjective>} <noun> <verb> [<adverb>]

<the> ::= "the"
<adjective> ::= "smelly" | "lazy"
<noun> ::= "dog" | "cat"
<verb> ::= "ate" | "ran"
<adverb> ::= "noisily" | "slowly"

Draw a diagram for an FSM which recognizes these sentences. Use EOI as the event that occurs at the end-of-input. Start with a state named S0. Receiving the word "the" in that state will transition to state S1. Name the final state END.

You can hand draw it and snap a picture, or use a drawing tool. Either way, upload the image, and put the file name in the answer below.

(Hint: my answer has seven states including the start and end states)

Convert this diagram into a table of the form:

S0        |    the    |     S1
S1        |    ...    |     ...

(hint: my version has 13 entries. Yours might be different)

S0        |    the    |     S1
S1        |    lazy   |     S1
S1        |    smelly |     S1
S1        |    dog    |     S2
S1        |    cat    |     S2
S2        |    ate    |     S3
S2        |    ran    |     S3
S3        |    slowly |     S4
S3        |    noisily|     S4
S3        |    EOI    |     END
S4        |    EOI    |     END

S0: start, EOI: end of input

Translate this table into a programming language of your choice. Then write a function that takes a list of words (ending "EOI") and runs the list through the state machine. If the state machine cannot find a transition for a word when in a given state, return false. If the state machine runs out of words and the state is not "END" then return false. Otherwise return true.

Then write some unit tests that exercise your function, making sure that it recognizes valid sentences and rejects invalid ones.

The answer should appear in one or more source files in the same directory as this file. If I need to do anything more that type a single command to run your code, include a script or makefile that will do the job.

Command: g++ -std=c++14 sentence.cpp -o sentence && ./sentence

I use C++ to code it. It works in C++14 but I am not sure about older versions.

How many valid sentences are there in this language?

Infinite number of sentences because we can have any number of adjectives.

Which is the simplest Chomsky grammar level for this language? In one sentence, explain why.

Type 3 because we can display it easily using Finite State Machine, which represents for type 3.