In Haskell Language write matchEmpty, which determines whether the language for a regular -- expression includes the empty string. matchEmpty :: RE symbol -> Bool matchEmpty = ? -- Note that the type signature does not restrict symbol to types with -- equality testing, so we cannot use match or match' to check whether the -- empty string is allowed. -- -- matchEmpty r = match r [] -- type error -- -- Similarly, we cannot use generate' and check whether the first string -- it provides is the empty string. -- -- Finally, while generate has the proper type, we cannot use it to write a -- function that always terminates, as we cannot conclude that the empty -- string is not present until we have examined every string. -- -- *HW3> matchEmpty (getRE "e") -- True -- *HW3> matchEmpty (getRE "abc*") -- False -- *HW3> matchEmpty (getRE "a*") -- True -- *HW3> matchEmpty (getRE "0") -- False -- *HW3> matchEmpty (getRE "0*") -- True NOTE: Above are a few examples of what the output will look like. All that needs to be done is matchEmpty needs to be defined where the question mark is.

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
In Haskell Language write matchEmpty, which determines whether the language for a regular
-- expression includes the empty string.
matchEmpty :: RE symbol -> Bool
matchEmpty = ?
-- Note that the type signature does not restrict symbol to types with
-- equality testing, so we cannot use match or match' to check whether the
-- empty string is allowed.
--
-- matchEmpty r = match r [] -- type error
--
-- Similarly, we cannot use generate' and check whether the first string
-- it provides is the empty string.
--
-- Finally, while generate has the proper type, we cannot use it to write a
-- function that always terminates, as we cannot conclude that the empty
-- string is not present until we have examined every string.
--
-- *HW3> matchEmpty (getRE "e")
-- True
-- *HW3> matchEmpty (getRE "abc*")
-- False
-- *HW3> matchEmpty (getRE "a*")
-- True
-- *HW3> matchEmpty (getRE "0")
-- False
-- *HW3> matchEmpty (getRE "0*")
-- True
 
NOTE: Above are a few examples of what the output will look like. All that needs to be done is matchEmpty needs to be defined where the question mark is.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Fibonacci algorithm
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