Spring 2022
Mar 29, 2022
CS 3304: Comparative Languages Project 3
Logical Programming
Copyright By PowCoder代写 加微信 powcoder
Due: Apr 14th, 2022 at 11:59 PM on Canvas Max Points: 100
Total Pages: 4
At some point in your schooling, you may have encountered the concept of diagramming sentences. A diagram of a sentence is a tree-like drawing representing the sentence’s grammatical structure, including parts such as the subject, verb, and object.
Here is an extended BNF grammar for some simple English sentences that we will use for the purposes of diagramming.
Spring 2022 Mar 29, 2022
Input Format
Your program should read “candidate sentences”, one per line, from a file named “input.txt”. For each input line, your program should attempt to interpret the line’s contents (a whitespace-separated list of words) as a sentence. You will need to read each entire line as a string. This string will have to be split into tokens, then feed them to your parsing routine. See the provided starter code for how to do this.
If there is another sentence after the current sentence, it will be followed by a space and then a period. If there are no sentences after the current one, the sentence will end with a new line.
Output Format
The output of your program should be produced in a file named “output.txt”. Your program should produce a “diagrammed” version of the input string, which means a sentence is in properly delimited form. “Properly delimited” means that each non-terminal appearing in the input string now has a set of delimiters around it For instance, the input string:
“alice found mean green book”
would be delimited as
( [ { alice } ] ) [ % found % ] ( [ < mean > < green > { book } ] )
A more complicated example is
“mean cow saw carefully green alice with book”
which returns
( [ < mean > { cow } ] ) [ % saw % $ carefully $ ] ( [ < green > { alice } * with * { book } ] )
In addition, there are two distinct error conditions that your program must recognize. First, if a given string does not consist of valid tokens, then respond with this message:
“input has invalid tokens”
Second, if the parameter is a string consisting of valid tokens but it is not a legitimate sentence according to the grammar, then respond with the message:
“input is not a sentence”
Note that the “invalid tokens” message takes priority over the second message; the “not a sentence” message can only be issued if the input string consists entirely of valid tokens.
Spring 2022 Mar 29, 2022
Let me see if I can shed some light on the various delimiters in the output above. I have tried to use some logic on how they are applied and help indicate the parts. So the subject and object each directly contain a noun phrase, so the ( ) on those parts indicate the subject or object phrase. Then the noun phrase and verb phrases are contained within [ ]. From there, each of the individual parts is contained within unique delimiters to set them apart from the other parts:
Delimiters
noun phrase
verb phrase
adjective phrase
prep phrase
preposition
Running/Testing your program
While you are working on your predicates, I recommend using swipl to load your file and make sure the smaller parts work. Once you are ready to test the entire program, from the terminal you can run this command:
swipl -f starter.pl
and it will run swipl with the file named starter.pl, use your filename if you didn’t call it starter.pl then write make_go_now() in the shell to meet that goal and if it is successful it will return true.
This is the command I will be using to test your code. So make sure you have the make_go_now predicate that makes all of your code go.
Spring 2022
Mar 29, 2022
Submitting Your Program
You will submit your code, starter.pl file, to Canvas for grading. Files Attached:
¡ñ starter.pl
¡ñ definitions.pl ¡ñ input.txt
¡ñ output.txt
¡ñ input_2.txt
¡ñ output_2.txt
¡ñ input_3.txt
¡ñ output_3.txt
< - - - - - - - - - End of the document - - - - - - - - - >
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com