This programming assignment is a user input validator. Acceptable input is zero or more characters from the alphabet of (a, b, +, *, (,)}. (Or the alphabet of your choice which includes the elementary regular expression operators of (+,*, (,)}) The program will allow the user to enter multiple lines of "words" from the console, each word will be delimited by a carriage return or a maximum of 1,000 characters. Blanks or tabs should be ignored. Following each word of input, the program will display the word along with an indication of whether the word consists of valid characters and which characters, if any, are invalid. The user will indicate the end of input by entering an empty word (a blank line). The following is an example run with the input in bold. Regular expression validator over the alphabet (a, b, +, *, (,)} Enter regular expression: ab VALID: ab ab (ba) * Enter regular expression: VALID: ab (ba) * Enter regular expression: INVALID: ab (ba) *X+ba (bb Enter regular expression: ) & 0# $b (ba) *X+ba (bb INVALID: ) &a# $b (-ba) *X+ba (bb A AA A Program terminated. ab ( ba) *X+ba ( bb Design and implement your program for future extensions, with a minimal amount of unessential complexity. This will permit the addition of expression processing functionality in the future assignments. Submit the solution in a convenient package which includes properly documented source code and an executable, if appropriate. Show Transcribed Text I would be really appreciated it if you can help me out with all the detail. Just don't copy and paste from another answer.
This programming assignment is a user input validator. Acceptable input is zero or more characters from the alphabet of (a, b, +, *, (,)}. (Or the alphabet of your choice which includes the elementary regular expression operators of (+,*, (,)}) The program will allow the user to enter multiple lines of "words" from the console, each word will be delimited by a carriage return or a maximum of 1,000 characters. Blanks or tabs should be ignored. Following each word of input, the program will display the word along with an indication of whether the word consists of valid characters and which characters, if any, are invalid. The user will indicate the end of input by entering an empty word (a blank line). The following is an example run with the input in bold. Regular expression validator over the alphabet (a, b, +, *, (,)} Enter regular expression: ab VALID: ab ab (ba) * Enter regular expression: VALID: ab (ba) * Enter regular expression: INVALID: ab (ba) *X+ba (bb Enter regular expression: ) & 0# $b (ba) *X+ba (bb INVALID: ) &a# $b (-ba) *X+ba (bb A AA A Program terminated. ab ( ba) *X+ba ( bb Design and implement your program for future extensions, with a minimal amount of unessential complexity. This will permit the addition of expression processing functionality in the future assignments. Submit the solution in a convenient package which includes properly documented source code and an executable, if appropriate. Show Transcribed Text I would be really appreciated it if you can help me out with all the detail. Just don't copy and paste from another answer.
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
Related questions
Question
Please send me answer of this question immediately and i will give you like sure sir
Transcribed Image Text:This programming assignment is a user input validator. Acceptable input is zero or more characters from the
alphabet of (a, b, +, *, (,)}. (Or the alphabet of your choice which includes the elementary regular expression
operators of (+,*, (,)})
The program will allow the user to enter multiple lines of "words" from the console, each word will be delimited
by a carriage return or a maximum of 1,000 characters. Blanks or tabs should be ignored.
с
Following each word of input, the program will display the word along with an indication of whether the word
consists of valid characters and which characters, if any, are invalid. The user will indicate the end of input by
entering an empty word (a blank line). The following is an example run with the input in bold.
Regular expression validator over the alphabet (a, b, +, *, (, )}
Enter regular expression: ab
VALID: ab
Enter regular expression: ab ( ba) *
VALID: ab (ba) *
Enter regular expression:
INVALID: ab (ba) *X+ba (bb
<blank line>
Program terminated.
Enter regular expression: ) & 0# $ b (ba) *X+ba ( bb
INVALID: ) &a# $b (-ba) *X+ba (bb
^ ^^ ^
ab ( ba) *X+ba ( bb
Design and implement your program for future extensions, with a minimal amount of unessential complexity.
This will permit the addition of expression processing functionality in the future assignments.
Show Transcribed Text
Submit the solution in a convenient package which includes properly documented source code and an
executable, if appropriate.
I would be really appreciated it if you can help me out with all the detail. Just don't copy and paste from another answer.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 2 images
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education