home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
OS/2 Shareware BBS: 10 Tools
/
10-Tools.zip
/
hugs101.zip
/
hugs101sc.zip
/
hugsdist
/
demos
/
Prolog
/
Parse
< prev
next >
Wrap
Text File
|
1995-02-14
|
4KB
|
105 lines
--
-- General parsing library, based on Richard Bird's parselib.orw for Orwell
-- (with a number of extensions)
-- Mark P. Jones November 1990, modified for Gofer 20th July 1991
--
-- uses Gofer version 2.28
--
infixr 6 `seq`
infixl 5 `do`
infixr 4 `orelse`
--- Type definition:
type Parser a = [Char] -> [(a,[Char])]
-- A parser is a function which maps an input stream of characters into
-- a list of pairs each containing a parsed value and the remainder of the
-- unused input stream. This approach allows us to use the list of
-- successes technique to detect errors (i.e. empty list ==> syntax error).
-- it also permits the use of ambiguous grammars in which there may be more
-- than one valid parse of an input string.
--- Primitive parsers:
-- fail is a parser which always fails.
-- okay v is a parser which always succeeds without consuming any characters
-- from the input string, with parsed value v.
-- tok w is a parser which succeeds if the input stream begins with the
-- string (token) w, returning the matching string and the following
-- input. If the input does not begin with w then the parser fails.
-- sat p is a parser which succeeds with value c if c is the first input
-- character and c satisfies the predicate p.
fail :: Parser a
fail is = []
okay :: a -> Parser a
okay v is = [(v,is)]
tok :: [Char] -> Parser [Char]
tok w is = [(w, drop n is) | w == take n is]
where n = length w
sat :: (Char -> Bool) -> Parser Char
sat p [] = []
sat p (c:is) = [ (c,is) | p c ]
--- Parser combinators:
-- p1 `orelse` p2 is a parser which returns all possible parses of the input
-- string, first using the parser p1, then using parser p2.
-- p1 `seq` p2 is a parser which returns pairs of values (v1,v2) where
-- v1 is the result of parsing the input string using p1 and
-- v2 is the result of parsing the remaining input using p2.
-- p `do` f is a parser which behaves like the parser p, but returns
-- the value f v wherever p would have returned the value v.
--
-- just p is a parser which behaves like the parser p, but rejects any
-- parses in which the remaining input string is not blank.
-- sp p behaves like the parser p, but ignores leading spaces.
-- sptok w behaves like the parser tok w, but ignores leading spaces.
--
-- many p returns a list of values, each parsed using the parser p.
-- many1 p parses a non-empty list of values, each parsed using p.
-- listOf p s parses a list of input values using the parser p, with
-- separators parsed using the parser s.
orelse :: Parser a -> Parser a -> Parser a
(p1 `orelse` p2) is = p1 is ++ p2 is
seq :: Parser a -> Parser b -> Parser (a,b)
(p1 `seq` p2) is = [((v1,v2),is2) | (v1,is1) <- p1 is, (v2,is2) <- p2 is1]
do :: Parser a -> (a -> b) -> Parser b
(p `do` f) is = [(f v, is1) | (v,is1) <- p is]
just :: Parser a -> Parser a
just p is = [ (v,"") | (v,is')<- p is, dropWhile (' '==) is' == "" ]
sp :: Parser a -> Parser a
sp p = p . dropWhile (' '==)
sptok :: [Char] -> Parser [Char]
sptok = sp . tok
many :: Parser a -> Parser [a]
many p = q
where q = ((p `seq` q) `do` makeList) `orelse` (okay [])
many1 :: Parser a -> Parser [a]
many1 p = p `seq` many p `do` makeList
listOf :: Parser a -> Parser b -> Parser [a]
listOf p s = p `seq` many (s `seq` p) `do` nonempty
`orelse` okay []
where nonempty (x,xs) = x:(map snd xs)
--- Internals:
makeList :: (a,[a]) -> [a]
makeList (x,xs) = x:xs
--- End of Parse.hs