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

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
icon
Related questions
Question

1,2 question sooo. 

 

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:
qo
q2
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
O->+|-|*|/
9. (*) Translate the following grammar to an NFA: E -> EOE | id,
10. Translate the NFA from task 5 to a grammar.
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: qo q2 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 O->+|-|*|/ 9. (*) Translate the following grammar to an NFA: E -> EOE | id, 10. Translate the NFA from task 5 to a grammar.
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Concept of memory addresses in pointers
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
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education