1. (*) Find regular expressions to define the following tokens: string constants, boolean constants, hexadecimal numbers. 2. Write a regular expression that matches the followwing positive cases and does not match the following negative cases
1. (*) Find regular expressions to define the following tokens: string constants, boolean constants, hexadecimal numbers. 2. Write a regular expression that matches the followwing positive cases and does not match the following negative cases
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
![1. (*) Find regular expressions to define the following tokens: string constants, boolean constants, hexadecimal numbers.
2. Write a regular expression that matches the following positive cases and does not match the following negative cases.
Try to make the regular expression as general as possible.
positive: 0, 10, 31, 1b, OB, 12x, 2aX, 1234567890, 11111000b, 123456789abcdefX, -0, -1b, -1bx
negative: 00, 010, 31b, 1c, Od, xx, OcX, a, 2b, 3B, gX, -a, --1, 1-1
3. Translate the following regular expressions into one NFA: keywords: 0(12)*, number: [0123]+, special: 171?
4. Translate your NFA from task 3 to a DFA. Show all important steps.
5. Minimize the following DFA:
a
qo
6. (*) When you translate a regular expression to an NFA, and then to a DFA, and then minimize it - do you get a unique result?
7. (*) Translate the DFA from task 5 to a regular expression. Show all important steps.
8. Translate the following grammar to an NFA: A-> aB | bA | b, B-> aC | bB, C-> aA | bC|a
9. (*) Translate the following grammar to an NFA: E -> EOE| id, O-> +| -|*|/
10. Translate the NFA from task 5 to a grammar.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Feb77a1be-d722-42e5-910e-d681789bab85%2F3f1aa625-74a7-4d80-a60d-13b259af80af%2Foflxryp_processed.jpeg&w=3840&q=75)
Transcribed Image Text:1. (*) Find regular expressions to define the following tokens: string constants, boolean constants, hexadecimal numbers.
2. Write a regular expression that matches the following positive cases and does not match the following negative cases.
Try to make the regular expression as general as possible.
positive: 0, 10, 31, 1b, OB, 12x, 2aX, 1234567890, 11111000b, 123456789abcdefX, -0, -1b, -1bx
negative: 00, 010, 31b, 1c, Od, xx, OcX, a, 2b, 3B, gX, -a, --1, 1-1
3. Translate the following regular expressions into one NFA: keywords: 0(12)*, number: [0123]+, special: 171?
4. Translate your NFA from task 3 to a DFA. Show all important steps.
5. Minimize the following DFA:
a
qo
6. (*) When you translate a regular expression to an NFA, and then to a DFA, and then minimize it - do you get a unique result?
7. (*) Translate the DFA from task 5 to a regular expression. Show all important steps.
8. Translate the following grammar to an NFA: A-> aB | bA | b, B-> aC | bB, C-> aA | bC|a
9. (*) Translate the following grammar to an NFA: E -> EOE| id, O-> +| -|*|/
10. Translate the NFA from task 5 to a grammar.
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 3 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education