Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Q1a

Q1a

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

Q1a2. 

 

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 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS