- write regular expressions which recognize each of the following things: Strings which contain the substring "ough" regardless of caseStrings which contain the word "Okay" (uppercase or lowercase), but with any number of a's in it (as long as there's at least one). Things which should match: "So, I said 'Okay.", "Is that reeeeally okaaay?", "Gate Agent: Mister Jon, you're all set. Lil Jon: Okaaaaay." Things which should not match: "ok", "okkayyyy", "oky", "pokey", "ooook"

- write regular expressions which recognize each of the following things: Strings which contain the substring "ough" regardless of caseStrings which contain the word "Okay" (uppercase or lowercase), but with any number of a's in it (as long as there's at least one). Things which should match: "So, I said 'Okay.", "Is that reeeeally okaaay?", "Gate Agent: Mister Jon, you're all set. Lil Jon: Okaaaaay." Things which should not match: "ok", "okkayyyy", "oky", "pokey", "ooook"

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

Similar questions

Program to accept and print a string using classes.
For this project, you will be writing regular expressions that look for and find all instances of a date in any given string. Your program should: Find the following different formats for dates: August 2nd, 1994 august 2, 1994 08/02/1994 08/02/94 08-02-1994 Your program should be case insensitive using re.IGNORECASE Your program can only have a maximum of two different regexes. A special prize goes to those of you who can fit all of this into one regex Your program should be able to tell if the date is a valid date. For example, if the date says 99/99/99, then your program should ignore this as a date. HINT: this is not done within the regex. Try saving your dates to something like a list and going through that list after your regex runs. At the end of your program, it should print out all of the dates in the following format: mm/dd/yyyy. EX. 08/02/1994 Your program should use at least two character classes, you may need more. Feel free to make your own custom classes as well.…
The countSubstring function will take two strings as parameters and will return an integer that is the count of how many times the substring (the second parameter) appears in the first string without overlapping with itself. This method will be case insensitive. For example: countSubstring(“catwoman loves cats”, “cat”) would return 2 countSubstring(“aaa nice”, “aa”) would return 1 because “aa” only appears once without overlapping itself. public static int countSubstring(String s, String x) { if (s.length() == 0 || x.length() == 0) return 1; if (s.length() == 1 || x.length() == 1){ if (s.substring(0,1).equals(x.substring(0,1))){ s.replaceFirst((x), " "); return 1 + countSubstring(s.substring(1), x); } else { return 0 + countSubstring(s.substring(1), x); } } return countSubstring(s.substring(0,1), x) + countSubstring(s.substring(1), x); } public class Main { public static void main(String[] args) { System.out.println(Recursion.countSubstring("catwoman loves cats","cat"));…
using Java. Part B – String Classifier (30%) This program will classify a string as one of the following: a palindrome, a repeated word, or “nothing special”. A word is considered repeated if it repeats only once in a string (e.g., “pizzapizza”). Some palindrome examples are: “racecar”, “aa”, and “aaa”. To determine if it is a palindrome, recommend you make use of the below method. Please make sure this program works for all cases and conditions. /** * This method will return a reversed version of the input string */ static String reverseString(String inStr) { String outStr = ""; if (inStr != null) { int startIndex = inStr.length()-1; for (int i=startIndex; i >= 0; i--) { outStr = outStr + inStr.charAt(i); } } return outStr; }
Which of the following statements is/are correct? I. The language L accepts all the strings of a's and b’s where the third symbol from left end is b. The regular expression for L is (a + b)² b(a+b)*. II. The language L accepts all the strings of a's and b's where the number of a's in a string is divisible by 3. The regular expression for L is (b* ab* ab*ab*)* . III. The regular expression R =(a+b)" . The number of states required to construct the minimal DFA for the regular expression R is n+2. (A) I and II (B) I and III (С) II and III (D) All are correct
Which of the following statements is/are correct? I. The language L accepts all the strings of a's and b's where the third symbol from left end is b. The regular expression for L is (a + b) b(a + b)*. II. The language L accepts all the strings of a's and b's where the number of a's in a string is divisible by 3. The regular expression for L is (b* ab* ab* ab* )*. III. The regular expression R=(a+b)“ . The number of states required to construct the minimal DFA for the regular expression R is n+2. (A) I and II (B) I and III (C) II and III (D) All are correct
Write a method isPalidrome(String arg) that determines if a String is palindrome or not. Palindrome is when a String remains the same after reversing. The method should return boolean typeWrite a method isPalidrome(String arg) that determines if a String is palindrome or not. Palindrome is when a String remains the same after reversing. The method should return boolean type
Q1__;. A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers. Given a string s, return true if it is a palindrome, or false otherwise. Example 1: Input: s = "A man, a plan, a canal: Panama" Output: true Explanation: "amanaplanacanalpanama" is a palindrome. Example 2: Input: s = "race a car" Output: false Explanation: "raceacar" is not a palindrome..
A. Which statement about regular expressions is correct? a. To find all occurrences of a matching substring for a regular expression, you must add thegflag. b. By default, pattern matching using regular expressions locates all matches in the searched string. c. To find all occurrences of a matching substring for a regular expression, you must add theiflag. d. The default behavior of a regular expression is modified by adding flags to the beginning of the expression. B. After the following JavaScript statements execute, the value ofcrayonsis["pink", "blue", "green"]. let crayons = ["pink", "purple"];crayons.shift();crayons.unshift("blue", "green"); Select one: True False
In this assignment you will use the MyString class that you wrote earlier in this course. A palindrome is a string that reads the same forward and backward. Write a program that reads in any number of MyStrings from the user and determines if each MyString is a palindrome. The user will terminate each MyString by pressing the return (or enter) button. The user will indicate that there are no more MyStrings by entering "quit". To do this you must write a recursive function named isAPalindrome that takes a single MyString argument and two arguments that are bounds on MyString indices. The function must examine the part of the argument between the two bounds (including the bounds) and return true if this part of the argument is a palindrome, false if it is not a palindrome. The function must be recursive and must not call any other functions except ispunct(), isspace(), and toupper() (described below). Do not make any changes to the MyString class (except, if necessary, to correct errors…
In this assignment you will use the MyString class that you wrote earlier in this course. A palindrome is a string that reads the same forward and backward. Write a program that reads in any number of MyStrings from the user and determines if each MyString is a palindrome. The user will terminate each MyString by pressing the return (or enter) button. The user will indicate that there are no more MyStrings by entering "quit". To do this you must write a recursive function named isAPalindrome that takes a single MyString argument and two arguments that are bounds on MyString indices. The function must examine the part of the argument between the two bounds (including the bounds) and return true if this part of the argument is a palindrome, false if it is not a palindrome. The function must be recursive and must not call any other functions except ispunct(), isspace(), and toupper() (described below). Do not make any changes to the MyString class (except, if necessary, to correct errors…
Write a method that finds the number of occurrences of a specified character in a string using thefollowing header:public static int countLetter(String str, char ch)Write a test program that prompts the user to enter a word and a letter of the alphabet. Theprogram should then count and display the number of occurrences of the letter in the word. Asample dialog for the program is shown below: