public class Magpie4 { /** * Get a default greeting * @return a greeting */ public String…

public class Magpie4 { /** * Get a default greeting * @return a greeting */ public String…
public class Magpie4
{
/**
* Get a default greeting
* @return a greeting
*/
public String getGreeting()
{
return “Hello, let's talk.”;
} /**
* Gives a response to a user statement
*
* @param statement
* the user statement
* @return a response based on the rules given
*/
public String getResponse(String statement)
{
String response = “”;
if (statement.length() == 0)
{
response = “Say something, please.”;
} else if (findKeyword(statement, “no”) >= 0)
{
response = “Why so negative?”;
}
else if (findKeyword(statement, “mother”) >= 0
|| findKeyword(statement, “father”) >= 0
|| findKeyword(statement, “sister”) >= 0
|| findKeyword(statement, “brother”) >= 0)
{
response = “Tell me more about your family.”;
} // Responses which require transformations
else if (findKeyword(statement, “I want to”, 0) >= 0)
{
response = transformIWantToStatement(statement);
} else
{
// Look for a two word (you me) pattern
int position = findKeyword(statement, “you”, 0); if (position >= 0 && findKeyword(statement, “me”, position) >= 0)
{
response = transformYouMeStatement(statement);
}
else
{
response = getRandomResponse();
}
}
return response;
} /**
* Take a statement with “I want to .” and transform it into
* “What would it mean to ?”
* @param statement: the user statement, assumed to contain “I want to”
* @return the transformed statement
*/
private String transformIWantToStatement(String statement)
{
// Remove the final period, if there is one
statement = statement.trim();
String lastChar = statement.substring(statement.length() – 1); if (lastChar.equals(“.”))
{
statement = statement.substring(0, statement.length() – 1);
}
int position = findKeyword (statement, “I want to”, 0);
String restOfStatement = statement.substring(position + 9).trim();
return “What would it mean to ” + restOfStatement + “?”;
} /**
* Take a statement with “you me” and transform it into
* “What makes you think that I you?”
* @param statement: the user statement, assumed to contain “you” followed by “me”
* @return the transformed statement
*/
private String transformYouMeStatement(String statement)
{
// Remove the final period, if there is one
statement = statement.trim();
String lastChar = statement.substring(statement.length() – 1); if (lastChar.equals(“.”))
{
statement = statement.substring(0, statement.length() – 1);
} int positionOfYou = findKeyword (statement, “you”, 0);
int positionOfMe = findKeyword (statement, “me”, positionOfYou + 3); String restOfStatement = statement.substring(positionOfYou + 3, positionOfMe).trim();
return “What makes you think that I ” + restOfStatement + ” you?”;
} /**
* Search for one word in phrase. The search is not case sensitive.
* This method will check that the given goal is not a substring of a longer string
* (so, for example, “I know” does not contain “no”).
* @param statement: the string to search
* @param goal: the string to search for
* @param startPos: the character of the string to begin the search at
* @return the index of the first occurrence of goal in statement or -1 if it's not found
*/
private int findKeyword(String statement, String goal, int startPos)
{
String phrase = statement.trim();
// The only change to incorporate the startPos is in the line below
int position = phrase.toLowerCase().indexOf(goal.toLowerCase(), startPos); // Refinement–make sure the goal isn't part of a word
while (position >= 0)
{
// Find the string of length 1 before and after the word
String before = ” “, after = ” “;
if (position > 0)
{
before = phrase.substring (position – 1, position).toLowerCase();
}
if (position + goal.length() <>
{
after = phrase.substring(position + goal.length(), position + goal.length() + 1).toLowerCase();
} // If before and after aren't letters, we've found the word
if (((before.compareTo (“a”) < 0="" )="" ||="" (before.compareto("z")=""> 0)) // before is not a letter
&& ((after.compareTo (“a”) < 0="" )="" ||="" (after.compareto("z")=""> 0)))
{
return position;
} // The last position didn't work, so let's find the next, if there is one.
position = phrase.indexOf(goal.toLowerCase(), position + 1); } return -1;
} /**
* Search for one word in phrase. The search is not case sensitive.
* This method will check that the given goal is not a substring of a longer string
* (so, for example, “I know” does not contain “no”). The search begins at the beginning of the string.
* @param statement: the string to search
* @param goal: the string to search for
* @return the index of the first occurrence of goal in statement or -1 if it's not found
*/
private int findKeyword(String statement, String goal)
{
return findKeyword (statement, goal, 0);
} /**
* Pick a default response to use if nothing else fits.
* @return a non-committal string
*/
private String getRandomResponse()
{
final int NUMBER_OF_RESPONSES = 4;
double r = Math.random();
int whichResponse = (int)(r * NUMBER_OF_RESPONSES);
String response = “”; if (whichResponse == 0)
{
response = “Interesting, tell me more.”;
}
else if (whichResponse == 1)
{
response = “Hmmm.”;
}
else if (whichResponse == 2)
{
response = “Do you really think so?”;
}
else if (whichResponse == 3)
{
response = “You don't say.”;
} return response;
} } The Magpie4Runner import java.util.Scanner; public class MagpieRunner4
{ /**
* Create a Magpie, give it user input, and print its replies.
*/
public static void main(String[] args)
{
Magpie4 maggie = new Magpie4(); System.out.println (maggie.getGreeting());
Scanner in = new Scanner (System.in);
String statement = in.nextLine(); while (!statement.equals(“Bye”))
{
System.out.println (maggie.getResponse(statement));
statement = in.nextLine();
}
} }     Apr 26 2022 01:29 PM

Place your order
(550 words)

Approximate price: $22

Calculate the price of your order

550 words
We'll send you the first draft for approval by September 11, 2018 at 10:52 AM
Total price:
$26
The price is based on these factors:
Academic level
Number of pages
Urgency
Basic features
  • Free title page and bibliography
  • Unlimited revisions
  • Plagiarism-free guarantee
  • Money-back guarantee
  • 24/7 support
On-demand options
  • Writer’s samples
  • Part-by-part delivery
  • Overnight delivery
  • Copies of used sources
  • Expert Proofreading
Paper format
  • 275 words per page
  • 12 pt Arial/Times New Roman
  • Double line spacing
  • Any citation style (APA, MLA, Chicago/Turabian, Harvard)

Our guarantees

Delivering a high-quality product at a reasonable price is not enough anymore.
That’s why we have developed 5 beneficial guarantees that will make your experience with our service enjoyable, easy, and safe.

Money-back guarantee

You have to be 100% sure of the quality of your product to give a money-back guarantee. This describes us perfectly. Make sure that this guarantee is totally transparent.

Read more

Zero-plagiarism guarantee

Each paper is composed from scratch, according to your instructions. It is then checked by our plagiarism-detection software. There is no gap where plagiarism could squeeze in.

Read more

Free-revision policy

Thanks to our free revisions, there is no way for you to be unsatisfied. We will work on your paper until you are completely happy with the result.

Read more

Privacy policy

Your email is safe, as we store it according to international data protection rules. Your bank details are secure, as we use only reliable payment systems.

Read more

Fair-cooperation guarantee

By sending us your money, you buy the service we provide. Check out our terms and conditions if you prefer business talks to be laid out in official language.

Read more
Open chat
1
You can contact our live agent via WhatsApp! Via + 1 (409) 205-8984

Feel free to ask questions, clarifications, or discounts available when placing an order.

Order your essay today and save 30% with the discount code DISCOUNT