#using <System.dll> #using <System.Windows.Forms.dll>

Transcription

1 Lecture #8 Introduction.NET Framework Regular Expression A regular expression is a sequence of characters, each has a predefined symbolic meaning, to specify a pattern or a format of data. Social Security Numbers, for example, typically adapt a format of , where 9 means a digit from 0 to 9. An address, on the other hand, must have the format of: accountid@domainname.domaintype. Regular expressions provide an efficient method for validating inputs and processing texts. The extensive pattern-matching notation of regular expressions enables a programmer to parse a long string literal to find specific character patterns; to validate text to ensure that it matches a predefined pattern (such as an address); to extract, edit, replace, or delete text substrings; and to add the extracted strings to a collection in order to generate a report. Visit for a list of Regular Expression Language which defines the symbolic meaning of most escaped characters and wildcard characters that can be used to constitute a pattern of regular expression. The following is a sample list of them: \b: Matches a backspace (\u0008). \d: Matches any decimal digit. \D: Matches any character other than a decimal digit. \s: Matches any white-space (spaces, tabs, and newlines) character. \S: Matches any non-white-space character. \w: Matches any word character. A word character is an alphabet that are used to spell an English word. It does not include numerals and symbols. \W: Matches any non-word character; the opposite of \w. The following is the complete sample code that demonstrates how to use escaped character, \d, to match any single digit in the string. In the following case, 1 and 2 are the matched item. Interestingly, it is necessary to use the backslash character (\) in a regular expression indicates that the second backslash that follows it is the indicator of escaped sequence. Therefore, \\d can be recognized as \d. String^ pattern = "\\d"; String^ str = "There is 1 apple, 2 oranges."; MessageBox::Show(Regex::IsMatch(str, pattern) + ""); The Regex class represents the.net Framework s regular expression engine. It can be used to quickly parse large amounts of text to find specific character patterns; to extract, edit, replace, or delete text substrings; or to add the extracted strings to a collection to generate a report. The Regex::IsMatch() method is often used to validate string input. It returns true if there is a match. The.NET Framework provides the System.Text.RularExpressions.Regex class which is a regular expression engine which can process text using regular expressions language. Adding the following statement can eliminate the need to use fully qualified names. Visual C++ Programming Penn Wu, PhD 207

2 The following is another example with the pattern "\\S\\d\\w", which means The first must be a non-white-space character, the second must be a digit, and the third must be a word character. String^ pattern = "\\S\\d\\w"; String^ str = "M3z k6p 68h are 3 examples."; MessageBox::Show(Regex::IsMatch(str, pattern) + ""); A simple regular expression pattern, ^\\w+\\@\\w+\\.\\w3$, can validate an of the format accountname@domainname.domaintype. The following is a sample code. // Define a regular expression for address. String^ pattern = "^\\w+\\@\\w+\\.\\w3$"; String^ s = InputBox::Show("Enter an address:"); while (!Regex::IsMatch(s, pattern)) MessageBox::Show(s + " is a not valid address."); s = InputBox::Show("Enter an address:"); MessageBox::Show("Your address is " + s); Patterns also uses quantifiers and anchors. A quantifier specifies how many instances of the previous element (which can be a character, a group, or a character class) must be present in the input string for a match to occur. Commonly used quantifiers are: *: Matches the previous element zero or more times. +: Matches the previous element one or more times.?: Matches the previous element zero or one time. n: Matches the previous element exactly n times. Anchors, or atomic zero-width assertions, cause a match to succeed or fail depending on the current position in the string, but they do not cause the engine to advance through the string or consume characters. Frequently used anchors are: Visual C++ Programming Penn Wu, PhD 208

3 ^: The match must start at the beginning of the string or line. $: The match must occur at the end of the string or before \n at the end of the line or string. \A: The match must occur at the start of the string. \Z: The match must occur at the end of the string or before \n at the end of the string. \z: The match must occur at the end of the string. \G: The match must occur at the point where the previous match ended. A U.S. phone number, for example, in the format of can be validated by the following regular expression. ^\d3-\d3-\d4$ The following is a sample code that demonstrates how to validate a user input with the above regular expression. Regex^ rx = gcnew Regex("^\\d3-\\d3-\\d4$"); String^ s = InputBox::Show("Enter a phone number: "); if (rx->ismatch(s)) MessageBox::Show(s + " is a valid U.S. phone number format."); else MessageBox::Show(s + " is a not valid phone number format."); The following is a regular expression pattern ^\d3-\d2-\d4$ which can check if a string matches a valid social security number in the United States. This pattern is interpreted as shown in the following table. Pattern Description ^ Match the beginning of the input string. \d3 Match three decimal digits. - Match a hyphen. \d2 Match two decimal digits. - Match a hyphen. \d4 Match four decimal digits. $ Match the end of the input string. The following code demonstrates the use of this methods with the above pattern. Visual C++ Programming Penn Wu, PhD 209

4 // Define a regular expression for SSN. String^ pattern = "^\\d3-\\d2-\\d4$"; String^ s = InputBox::Show("Enter a SSN:"); while (!Regex::IsMatch(s, pattern)) MessageBox::Show(s + " is a not valid SSN."); s = InputBox::Show("Enter a SSN:"); MessageBox::Show("Your SSN is " + s); The alternation construct can matches any one element separated by the vertical bar ( ) character. For example, a pattern, th(e is at), can match the, this in this is the day. The following demonstrates how you can validate an URL address with three alternatives of protocols. // Define a regular expression for URL. String^ pattern = "(ftp http https)://(\\w+\\.)(\\w+\\.)\\w3"; String^ s = InputBox::Show("Enter a URL:"); while (!Regex::IsMatch(s, pattern)) MessageBox::Show(s + " is a not valid URL."); s = InputBox::Show("Enter a URL:"); MessageBox::Show("Your URL is " + s); The following syntax can define a character range which matches any single character in the range from first to last. [first - last] Some of the sample usages are: Regular expression ^[a-za-z]*$ Description must be alphabets only Visual C++ Programming Penn Wu, PhD 210

5 ^[0-9]*$ ^((0?[1-9] 1[012])[- /.](0?[1-9] [12][0-9] 3[01])[- /.](19 20)?[0-9]2)*$ ^((?:(?:25[0-5] 2[0-4][0-9] [01]?[0-9][0-9]?)\\.)3(?:25[0-5] 2[0-4][0-9] [01]?[0-9][0-9]?))*$ numerals only MM/DD/YYYY date format IPv4 address The following code can force the user to enter nothing but an integer as input. String^ s = InputBox::Show("Enter an integer:"); while (s==""!regex::ismatch(s, "^[0-9]*$")) MessageBox::Show("Must be a integer"); s = InputBox::Show("Enter an integer:"); int x = Convert::ToInt32(s); MessageBox::Show("Square is " + x*x); The following accepts only alphabets (upper- and lower-cases) as input. The * quantifier matches the previous element zero or more times. String^ s = InputBox::Show("Enter your first name:"); if (Regex::IsMatch(s, "^[a-za-z]*$")) MessageBox::Show("Welcome, " + s); else MessageBox::Show("A ridiculous name."); The following is a long regular expression pattern. ^[a-za-z0-9]\d2[a-za-z0-9](-\d3)2[a-za-z0-9]$ Visual C++ Programming Penn Wu, PhD 211

6 The following table shows how the regular expression pattern is interpreted. Pattern Description ^ Begin the match at the beginning of the line. [a-za-z0-9] Match a single alphabetic character (a through z or A through Z) or numeric character. \d2 Match two numeric characters. [a-za-z0-9] Match a single alphabetic character (a through z or A through Z) or numeric character. - Match a hyphen. \d3 Match exactly three numeric characters. (-\d3)2 Find a hyphen followed by three numeric characters, and match two occurrences of this pattern. [a-za-z0-9] Match a single alphabetic character (a through z or A through Z) or numeric character. $ End the match at the end of the line. The following example illustrates the use of the IsMatch(string) method to determine whether a string is a valid part number using the above regular expression pattern. The regular expression assumes that the part number has a specific format that consists of three sets of characters separated by hyphens. The first set, which contains four characters, must consist of an alphanumeric character followed by two numeric characters followed by an alphanumeric character. The second set, which consists of three characters, must be numeric. The third set, which consists of four characters, must have three numeric characters followed by an alphanumeric character. // Define a regular expression Regex^ rx = gcnew Regex("^[a-zA-Z0-9]\\d2[a-zA-Z0-9](- \\d3)2[a-za-z0-9]$"); // Define a test string. String^ s = InputBox::Show("Enter a part number:"); if (rx->ismatch(s)) MessageBox::Show(s + " is a valid part number."); else MessageBox::Show(s + " is a not valid part number."); This code also uses the Regex(pattern) constructor. This constructor can initialize a new instance of the Regex class for the specified regular expression. The syntax is: Regex^ objname = gcnew Regex(pattern); Visual C++ Programming Penn Wu, PhD 212

7 The pattern parameter consists of regular expression language elements that symbolically describe the string to match. The regular expression will be used to find case-sensitive matches of any alphabetical characters defined in pattern. For example, a pattern with the following format can match any single character enclosed by the brackets (by default, the match is case-sensitive). A character set is a series of characters. [characterset] In the following example, [ae] can match a or e in words like gray, bend, grand, glen, and lane. Interestingly, the letter A in An is capitalized. It does not match with the [ae] regular expression. Only the rest of words with either a or e or both in the sentence will match. The bold-faced are the ones that match with this regular expression. String^ str = "An apple a day keeps doctors away."; Regex^ regex1 = gcnew Regex("[ae]"); On the other hand, the escaped character \b means matches a backspace. The \w pattern matches any word character and the + pattern matches the previous element one or more times. Therefore, the pattern \b[at]\w+ actually means matches any word that begins with the letters a or t. In the following example, only the word the meet this requirement. String^ str = "Can you find the right word?"; Match^ match = Regex::Match(str, "\\b[at]\\w+"); A Regex object can be used only for defining the pattern. The checking of match is done by the MatchCollection class. The MatchCollection class represents the set of successful matches found by iteratively applying a regular expression pattern to the input string. The Count property of MatchCollection class returns the number of matches. The Item property returns an individual member of the collection. In addition to the IsMatch(string) method which indicates whether the regular expression specified in the Regex constructor finds a match in a specified input string, the Regex class also provides some useful methods. A later section of this lecture will discuss them in details. Match(string): Searches the specified input string for the first occurrence of the regular expression specified in the Regex constructor. Replace(string, string): In a specified input string, replaces all strings that match a regular expression pattern with a specified replacement string. Split(string): Splits an input string into an array of substrings at the positions defined by a regular expression pattern specified in the Regex constructor. Interestingly, an instance of the MatchCollection object is actually a System::Text::RegularExpressions::Match object, except it is populated as needed on a matchby-match basis. Therefore, the matched items are stored in a collection of Match class which can be access using a loop or the for..each statement. The following example illustrates the use of the MatchCollection class to check for matching items. The Regex->Matches() method searches the specified input string for all occurrences of a regular expression, yet it returns a MatchCollection object. Visual C++ Programming Penn Wu, PhD 213

8 String^ str = "An apple a day keeps doctors away."; Regex^ regex1 = gcnew Regex("\\b[at]\\w+"); MatchCollection^ m = regex1->matches(str); str = "There are " + m->count + " occurrences.\n"; for each (Match^ s in m) str += s + "\n"; MessageBox::Show(str); The output looks: The above example uses the MatchCollection class to create an instance that is actually an object of the Match class. However, you can simply create an instance of the Match class without using the MatchCollection class. The Match class provides a set of tools to process the results from a single regular expression match. An instance of the Match class is returned by the Regex::Match() method using the following syntax to return the first substring that matches a regular expression pattern in an input string. Match^ objid = Regex::Match(String, pattern) For example, the Regex::Match() method and represents the first pattern match in a string. Subsequent matches are represented by the Match::NextMatch() method. The Success property of a Match object is a Boolean property that can determine whether the regular expression pattern has been found in the string. If a match is found, the returned Match object s Value property contains the substring from input that matches the regular expression pattern. If no match is found, its value is set to be null (String.Empty). The Index property returns the position in the original string where the first character of the captured substring is found. The following is a complete sample code. String^ str = "Can you find the right 'tech' word?"; Match^ m = Regex::Match(str, "\\b[at]\\w+"); str += "\n"; while (m->success) Visual C++ Programming Penn Wu, PhD 214

9 str += "Found: " + m->value + " at position " + m->index + "\n"; m = m->nextmatch(); MessageBox::Show(str); The output looks: The regular expression pattern \b(\w+)\w+(\1)\b is interpreted as shown in the following table. Pattern Description \b Begin the match on a word boundary. (\w+) Match one or more word characters. This is the first capturing group. \W+ Match one or more non-word characters. (\1) Match the first captured string. This is the second capturing group. \b End the match on a word boundary. The following code uses the RegexMatch(string, string) method to find the first occurrence of a duplicated word in a string. It then calls the MatchNextMatch() method to find any additional occurrences. This sample code also examines the Match.Success property after each method call to determine whether the current match was successful and whether a call to the MatchNextMatch() method should follow. The Match->Groups property gets a collection of groups matched by the regular expression. A regular expression pattern can include subexpressions, which are defined by enclosing a portion of the regular expression pattern in parentheses. Every such sub-expression forms a group. A group is enclosed by a pair of parentheses. The regular expression pattern, \b(\w+)\w+(\1)\b, as stated earlier, has a boundary defined by a pair of \b and \b. The first group is defined by (\w+) and the second group is defined by (\1). The first group is represented by m->group[1] and the second is represented by m- >Group[2]. The Group[i]->Value property displays the result string for each capturing group. The Index property returns the position in the string where the first character of the captured substring is found. String^ pattern = "\\b(\\w+)\\w+(\\1)\\b"; String^ str = "This is a a farm that that raises dairy cattle."; Match^ m = Regex::Match(str, pattern); str = ""; // set value to blank Visual C++ Programming Penn Wu, PhD 215

10 The output looks: while (m->success) str += "Duplicate " + m->groups[1]->value; str += " found at position " + m->groups[2]->index + "\n"; m = m->nextmatch(); MessageBox::Show(str); The Match->Groups property is helpful in identify error(s) of a data format, for example, the regular expression pattern, (\d3)-(\d3)-(\d4), can match North American telephone numbers. It can be considered having three sub-expressions. The first consists of the area code, which composes the first three digits of the telephone number. This group is captured by the first portion of the regular expression, (\d3).the second consists of the individual telephone number, which composes the last seven digits of the telephone number. This group is captured by the second portion of the regular expression, (\d3), and the third group is represented by (\d4). These three groups can then be retrieved from the GroupCollection object that is returned by the Groups property, as the following example shows. Be sure to add an $ sign to end the match at the end of the line. String^ pattern = "(\\d3)-(\\d3)-(\\d4)$"; String^ input = InputBox::Show("Enter a phone number: "); MatchCollection^ m = Regex::Matches(input, pattern); String^ str = ""; for each (Match^ s in m) str += "Area Code: " + s->groups[1]->value + "\n"; str += "Prefix: " + s->groups[2]->value + "\n"; str += "Line No.: " + s->groups[3]->value + "\n"; MessageBox::Show(str); Visual C++ Programming Penn Wu, PhD 216

11 The output looks: Validating password according to a set of rules is a common practice of regular expression. String^ pattern = "^(?=.*\\d)(?=.*[a-z])(?=.*[a-z]).6,8$"; The above regular expression can validate a password with the following regulations: At least one digit At least one lowercase letter At least one uppercase letter the length must be 6 ~ 8 characters and Useful methods of the Regex class The Regex class supports several methods to process text-based on the result of matching of regular expression. The Regex::Replace(input, replacement), in a specified input string, can replace all strings that match a regular expression pattern with a specified replacement string. The search for matches starts at the beginning of the input string. The regular expression is the pattern defined by the constructor for the current Regex object. The following example defines a regular expression, \s+, that matches one or more white-space characters. The replacement string,, replaces them with a single space character. String^ input= "This is text with far too much whitespace."; String^ replacement = " "; Regex^ rx = gcnew Regex("\\s+"); // define the delimiter String^ result = rx->replace(input, replacement); MessageBox::Show(input + "\nbecomes\n" + result); The output looks: Visual C++ Programming Penn Wu, PhD 217

12 The following example uses a regular expression pattern (Mr\.? Mrs\.? Miss Ms\.? ) to match any occurrence of Mr, Mr., Mrs, Mrs., Miss, Ms or Ms.. The call to the Regex.Replace() method replaces the matched string with String.Empty; in other words, it removes it from the original string. String^ pattern = "(Dr\\.? Mr\\.? Mrs\\.? Miss Ms\\.? )"; array<string^>^ names = gcnew array <String^> "Miss Helen Chang", "Ms. Arcy Zolanski", "Dr. Steven Wang", "Mr. Thomas Brown", "Mrs. Nicole Smith", "Pastor Larry King"; String^ str = ""; for each (String^ name in names) str += (Regex::Replace(name, pattern, String::Empty)) + "\r"; MessageBox::Show(str); The Rege->Split(input, pattern) method splits an input string into an array of substrings at the positions defined by a regular expression pattern. The input string is split as many times as possible. If pattern is not found in the input string, the return value contains one element whose value is the original input string. The pattern parameter consists of regular expression language elements that symbolically describe the string to match. The following code shows how to split a string into a String array using a single semicolon as delimiter (:). String^ str = "Jane:Smith:Sales Rep.:46782:E321"; Regex^ rx = gcnew Regex(":"); // define the delimiter array<string^>^ s = rx->split(str); String^ result = ""; for each (String^ m in s) Visual C++ Programming Penn Wu, PhD 218

13 result += m + "\n"; MessageBox::Show(result); The output looks: The above code may be simplified to the following and still produce the same result. String^ str = "Jane:Smith:Sales Rep.:46782:E321"; array<string^>^ s = Regex::Split(str, ":"); // with pattern String^ result = ""; for each (String^ m in s) result += m + "\n"; MessageBox::Show(result); The following code uses two sets of capturing parentheses to extract the elements of a date, including the date delimiters, from a date string. The first set of capturing parentheses captures the hyphen, and the second set captures the forward slash. Interestingly, starting with the.net Framework 2.0, all captured text is also added to the returned array; therefore, it is necessary to use a continue statement to skip them. String^ input = "09/23/ "; String^ pattern = "(-) (/)"; String^ str = ""; Visual C++ Programming Penn Wu, PhD 219

14 for each (String^ s in Regex::Split(input, pattern)) if (s=="-" s=="/") continue; str += s + " "; MessageBox::Show(str); The output looks: Review Question 1. Which escaped character defined by the.net Framework matches any character other than a decimal digit? A. \B B. \b C. \d D. \D 2. Given the following code segment, which can identify any work with one character only? String^ pattern = "\\d"; String^ str = "That is a clock"; A. MessageBox::Show(IsMatch(str, pattern)); B. MessageBox::Show(IsMatch(str, pattern) + ""); C. MessageBox::Show(Regex::IsMatch(str, pattern) + ""); D. MessageBox::Show(Regex::IsMatch(str, pattern)); 3. Which can match three decimal digits? A. \d3 B. \d0-3 C. \d[3] D. \d[0-3] 4. Given a regular expression a pattern, th(e is at), which of the following cannot be matched? A. the B. theeth C. that D. this 5. The quantifier matches the previous element zero or more times. A. * B. ^ C.? D Which can match nothing but alphabets only? A. ^[a-z]*$ B. ^[a-za-z]*$ C. ^[A-z]*$ Visual C++ Programming Penn Wu, PhD 220

15 D. ^[a-za-z0-9]*$ 7. Which can define a regular expression with an instance named "rx" in Visual C++? A. Regex^ rx = Regex("^[a-zA-Z0-9]$"); B. Regex^ rx = "^[a-za-z0-9]$"; C. Regex^ rx = gcnew Regex("^[a-zA-Z0-9]$"); D. Regex^ rx = gcnew "^[a-za-z0-9]$"; 8. Given a regular expression, [ae], which word will not match with it? A. gray B. Apex C. teeth D. apple 9. Given the following code segment, which can represent the subsequent matches after the first match if any? String^ str = "Can you find the right 'tech' word?"; Match^ m = Regex::Match(str, "\\b[at]\\w+"); A. m = m->match(); B. m = m->nextmatch(); C. m = m->matchnext(); D. m = m->next(); 10. Given the following code segment, the output is. String^ str = "11:57:21 AM"; Regex^ rx = gcnew Regex(":"); array<string^>^ s = rx->split(str); String^ result = "The current time is: "; for each (String^ m in s) result += m + " "; A. The current time is: 11:57:21 AM B. The current time is: AM C. The current time is: AM D. The current time is: 11:57:21AM Visual C++ Programming Penn Wu, PhD 221

16 Lab #8.NET Framework Regular Expression Learning Activity #1: 1. Create the C:\cis223 directory if it does not exist. 2. Launch the Developer Command Prompt (not the regular Command Prompt) and change to the C:\cis223 directory. 3. Use Notepad to create a new text file named lab8_1.cpp with the following contents: using namespace System::IO::Ports; Regex^ rx = gcnew Regex("\\d3-\\d3-\\d4$"); String^ s = InputBox::Show("Enter a phone number [ ]: "); if (rx->ismatch(s)) SerialPort^ serialport1 = gcnew SerialPort; try // exception handling serialport1->open(); serialport1->dtrenable = true; serialport1->write("atdt " + s); catch (Exception^ e) MessageBox::Show(e->Message); else MessageBox::Show(s + " is a not valid phone number."); s = InputBox::Show("Enter a phone number: "); 4. Type cl /clr lab8_1.cpp /link /subsystem:windows /ENTRY:main and press [Enter] to compile. Test the program. A sample output looks: and or and Visual C++ Programming Penn Wu, PhD 222

17 5. Download the assignment template, and rename it to lab8.doc if necessary. Capture a screen shot similar to the above figure and paste it to the Word document named lab8.doc (or.docx). Learning Activity #2: validate URL 1. Use Notepad to create a new text file named lab8_2.cpp with the following contents: [STAThread] // Define a regular expression for URL. String^ pattern = "(ftp http https)://(\\w+\\.)(\\w+\\.)\\w3"; String^ s = InputBox::Show("Enter a URL:"); if (s=="") MessageBox::Show("Not input detected."); s = InputBox::Show("Enter a URL:"); while (!Regex::IsMatch(s, pattern)) MessageBox::Show(s + " is a not valid URL."); s = InputBox::Show("Enter a URL:"); //start the default Internet browser System::Diagnostics::Process::Start(s); 2. Compile and test the program. A sample output looks: 3. Capture a screen shot similar to the above figure and paste it to the Word document named lab8.doc (or.docx). Learning Activity #3: 1. Use Notepad to create a new text file named lab8_3.cpp with the following contents: and Visual C++ Programming Penn Wu, PhD 223

18 // Define a regular expression for repeated words. Regex^ rx = gcnew Regex("\\b(?<word>\\w+)\\s+(\\k<word>)\\b"); // Define a test string. String^ str = InputBox::Show("Enter a paragraph"); // Find matches. MatchCollection^ m = rx->matches(str); str = m->count + " matches found.\n\n"; for each (Match^ s in m) str += s->groups["word"]->value + " repeated at position " + s->index + "\n"; MessageBox::Show(str); 2. Compile and test the program. Type a sentence with repeating words. A sample output looks: Learning Activity #4: 1. Use Notepad to create a new text file named lab8_4.cpp with the following contents: and String^ pattern = "(\\d3)-(\\d3)-(\\d4)$"; String^ input = InputBox::Show("Enter a phone number: "); MatchCollection^ m = Regex::Matches(input, pattern); String^ str = ""; for each (Match^ s in m) str += "Area Code: " + s->groups[1]->value + "\n"; str += "Prefix: " + s->groups[2]->value + "\n"; str += "Line No.: " + s->groups[3]->value + "\n"; Visual C++ Programming Penn Wu, PhD 224

19 MessageBox::Show(str); 2. Compile and test the program. A sample output looks: 3. Capture a screen shot similar to the above figure and paste it to the Word document named lab8.doc (or.docx). Learning Activity #5: 1. Use Notepad to create a new text file named lab8_5.cpp with the following contents: and String^ processit(string^ str) Regex^ rx = gcnew Regex(":"); // define the delimiter array<string^>^ s = rx->split(str); String^ result = ""; for each (String^ m in s) result += m + "\t"; return result; array<string^>^ input = "Jane:Smith:Sales Rep.:46782:E321", "Tim:Locker:Tech II:45236:A421", "Helen:Chen:HR Staff:41689:M129", "Stanley:Wu:MIS:44217:K168" ; String^ output = "First\tLast\tDept\tExt.\tID\n";// \t is tab for (int i=0; i<input->length; i++) output += processit(input[i]) + "\n"; MessageBox::Show(output); 2. Compile and test the program. A sample output looks: Visual C++ Programming Penn Wu, PhD 225

20 3. Capture a screen shot similar to the above figure and paste it to the Word document named lab8.doc (or.docx). Submittal 1. Complete all the 5 learning activities and the programming exercise in this lab. 2. Create a.zip file named lab08.zip containing ONLY the following self-executable files. Lab8_1.exe Lab8_2.exe Lab8_3.exe Lab8_4.exe Lab8_5.exe lab8.doc (or.docx or.pdf) [You may be given zero point if this Word document is missing] 3. Upload the zipped file to Question 11 of Assignment as response. 4. Upload ex08.zip file to Question 12 as response. Note: You will not receive any credit if you submit file(s) to the wrong question. Programming Exercise 08: 1. Launch the Developer Command Prompt. 2. Use Notepad to create a new text file named ex08.cpp. 3. Add the following heading lines (Be sure to use replace [YourFullNameHere] with the correct one). //File Name: ex08.cpp //Programmer: [YourFullNameHere] 4. Write a Visual C++ code, with the InputBox.cpp library file, to ask the user to enter an IP address, then use an appropriate regular expression to validate the format of the IP address. Display Invalid IP format or Valid IP accordingly. and or and 5. Your application must meet the above requirements to get credit. No partial credit is given. 6. Download the programming exercise template, and rename it to ex08.doc if necessary. Capture Capture a screen similar to the above one and paste it to the Word document named ex08.doc (or.docx). 7. Compress the source file (ex08.cpp), executable code (ex08.exe), and Word document (ex08.doc) to a.zip file named ex08.zip. Grading criteria: Visual C++ Programming Penn Wu, PhD 226

21 You will earn credit only when the following requirements are fulfilled. No partial credit is given. You successfully submit both source file and executable file. Your source code must be fully functional and may not contain syntax errors in order to earn credit. Your executable file (program) must be executable to earn credit. Threaded Discussion Note: Students are required to participate in the thread discussion on a weekly basis. Student must post at least two messages as responses to the question every week. Each message must be posted on a different date. Grading is based on quality of the message. Question: Class, regular expression is design to handle structured data (data that has a format and type). Is it possible to use regular expression in a Visual C++ application to verify and valid the basic English structure, such as a incorrect sentence like "I is a boy, you is a girl, they is women."? [There is never a right-or-wrong answer for this question. Please free feel to express your opinion.] Be sure to use proper college level of writing. Do not use texting language. Visual C++ Programming Penn Wu, PhD 227