Exercise 10: Develop a regular expression that will accept strings consisting of three or four words only (a word is a collection of "word" characters separated by a space, the start of the expression, or the end of the expression). There may or may not be punctuation at the end of the string: (Hint: The test cases include cases where there are extra spaces at the end of the string) Exercise 10 Test Strings: Test Suite: (Should be ACCEPTED) REJECTI one two three REJECT: one two three four REJECT: 1 2 3 4 REJECT: how many worda? Test Suite: (Should be REJECTED): REJECT: word word REJECT: word REJECT: MOrd word REJECT: word word word seord word REJECT: Mord! word word REJECT: word word

Exercise 10: Develop a regular expression that will accept strings consisting of three or four words only (a word is a collection of "word" characters separated by a space, the start of the expression, or the end of the expression). There may or may not be punctuation at the end of the string: (Hint: The test cases include cases where there are extra spaces at the end of the string) Exercise 10 Test Strings: Test Suite: (Should be ACCEPTED) REJECTI one two three REJECT: one two three four REJECT: 1 2 3 4 REJECT: how many worda? Test Suite: (Should be REJECTED): REJECT: word word REJECT: word REJECT: MOrd word REJECT: word word word seord word REJECT: Mord! word word REJECT: word word

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: You will be able to pinpoint the position of the substring in which you are interested by using one…

A: Answer is given below

Q: Using an instance of a string, you may determine the location of the substring

A: Yes, this statement is completely true because by using any instance of string, you can determine…

Q: tunction name: is_long o parameters:a string word • returns: True if word has more than 12…

A: I have given an answer in step 2.

Q: Groups and ranges indicate groups and ranges of expression characters. The regular expression xly…

A: Algorithm: First we will pass the input string in the log then match the sting with regular…

Q: two links down, making each link. ate a project named Classic BookSelector that contains a Form with…

A: using System;using System.Collections.Generic;using System.ComponentModel;using System.Data;using…

Q: Assignment Write a program that displays a menu with shape options, for example: 1-) Triangle 2-)…

A: Answer: Algorithms: Step1: we have print the menu for the finding the area Step2: then we have ask…

Q: 2. A password is called STRONG if it holds all of the following properties: (a) It has at least 8…

A: Hello student The answer will be in next step :-

Q: Using one of the of a string object will allow you to determine the location of the substring that…

A: Introduction: The string discovers command is used to find the first instance of a sub-string in a…

Question

Exercise 10: Develop a regular expression that will accept strings consisting of three or four words only (a word is a collection of "word" characters separated by a space, the start of the expression, or the end of the expression).
There may or may not be punctuation at the end of the string: (Hint: The test cases include cases where there are extra spaces at the end of the string)
Exercise 10
Test Strings:
Test Suite: (Should be ACCEPTED)
REJECT: One two three
REJECT: one two three four
REJECT: 1 2 3 4
REJECT: hoM many words?
Test Suite: (Should be REJECTED):
REJECT: WOrd word
REJECT: WOrd
REJECT: WOrd word
REJECT: Word word word word word
REJECT: Word! word word
REJECT: word word

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

JAVA PPROGRAM ASAP Please create this program ASAP BECAUSE IT IS MY LAB ASSIGNMENT so it passes all the test cases. The program must pass the test case when uploaded to Hypergrade. Chapter 9. PC #2. Word Counter (page 608) Write a method that accepts a String object as an argument and returns the number of words it contains. For instance, if the argument is “Four score and seven years ago” the method should return the number 6. Demonstrate the method in a program that asks the user to input a string and then passes it to the method. The number of words in the string should be displayed on the screen. Test Case 1 Please enter a string or type QUIT to exit:\nHello World!ENTERThere are 2 words in that string.\nPlease enter a string or type QUIT to exit:\nI have a dream.ENTERThere are 4 words in that string.\nPlease enter a string or type QUIT to exit:\nJava is great.ENTERThere are 3 words in that string.\nPlease enter a string or type QUIT to exit:\nquitENTER
X609: Magic Date A magic date is one when written in the following format, the month times the date equals the year e.g. 6/10/60. Write code that figures out if a user entered date is a magic date. The dates must be between 1 - 31, inclusive and the months between 1 - 12, inclusive. Let the user know whether they entered a magic date. If the input parameters are not valid, return false. Examples: magicDate(6, 10, 60) -> true magicDate(50, 12, 600) –> false
Lab Goal : This lab was designed to teach you how to use a while loop. Lab Description (JAVA PROGRAMMING): Remove all occurrences of the removal string from the original string. Each time you take out the removal string you must also remove the letter that preceded the removal string. After you remove a string and its leading character, you must check to see if any more occurrences of the removal string exist. Sample Data : xR-MxR-MHelloxR-M R-M sxsssxssxsxssexssxsesss xs fuxqwexqwertyxqwexqwe Sample Output : xR-MxR-MHelloxR-M - String to remove R-M Hello sxsssxssxsxssexssxsesss - String to remove xs sesss fuxqwexqwertyxqwexqwertyrtyxqwertyrtyn - String to remove qwerty fun dogdogcatddodogdogdoggog - String to remove dog catgog algorithm help use indexOf to look for more removals while you have more removals { take out the current removal using substring use indexOf to look for more removals } I need help with assignment: "String Cleaner" StringRemover.js: //(c) A+…
color: one of the following strings: 'red', 'blue', 'silver', 'white', 'black'year: year of manufacturing. A number between 1990 and 2018company: one of the following strings: 'Honda', 'Toyota', 'Ford', 'Chevrolet'model: one of the following strings: 'sedan', 'hatchback', 'SUV'Give a logical expression that evaluates to a True or False for a set of cars. e.g. Expression for "Red SUV cars" is (color == "red" and model == "SUV") Give an expression for "Ford sedan cars that are red or blue and were manufactured after 2000"
Python please: If the score is between 90 and 100, the grade is A, and the teacher comment is 'Exceptional work' for 100 only 'Excellent work' for anything other than 100 If the score is between 80 and 89, the grade is B, and the teacher comment is 'Very Good, can do better' If the score is between 70 and 79, the grade is C, and the teacher comment is 'Good, but need to work harder' If the score is between 60 and 69, the grade is D, and there are no teacher comments. If the score is below 60, the grade is F, and the teacher comment is 'Fail, need to appear for a retest' For example if the input (student test score) is 100 the output is The Student grade is A and the teacher comment is 'Exceptional work'
TRUE-FALSE: Type YES if the given statement is correct. Otherwise, type NO. Analyzing information nowadays is easier than in the past.