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.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 8SA
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning