diff --git a/LICENSE b/LICENSE new file mode 100644 --- /dev/null +++ b/LICENSE @@ -0,0 +1,340 @@ + GNU GENERAL PUBLIC LICENSE + Version 2, June 1991 + + Copyright (C) 1989, 1991 Free Software Foundation, Inc. + 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +License is intended to guarantee your freedom to share and change free +software--to make sure the software is free for all its users. This +General Public License applies to most of the Free Software +Foundation's software and to any other program whose authors commit to +using it. (Some other Free Software Foundation software is covered by +the GNU Library General Public License instead.) You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +this service if you wish), that you receive source code or can get it +if you want it, that you can change the software or use pieces of it +in new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid +anyone to deny you these rights or to ask you to surrender the rights. +These restrictions translate to certain responsibilities for you if you +distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must give the recipients all the rights that +you have. You must make sure that they, too, receive or can get the +source code. And you must show them these terms so they know their +rights. + + We protect your rights with two steps: (1) copyright the software, and +(2) offer you this license which gives you legal permission to copy, +distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain +that everyone understands that there is no warranty for this free +software. If the software is modified by someone else and passed on, we +want its recipients to know that what they have is not the original, so +that any problems introduced by others will not reflect on the original +authors' reputations. + + Finally, any free program is threatened constantly by software +patents. We wish to avoid the danger that redistributors of a free +program will individually obtain patent licenses, in effect making the +program proprietary. To prevent this, we have made it clear that any +patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and +modification follow. + + GNU GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License applies to any program or other work which contains +a notice placed by the copyright holder saying it may be distributed +under the terms of this General Public License. The "Program", below, +refers to any such program or work, and a "work based on the Program" +means either the Program or any derivative work under copyright law: +that is to say, a work containing the Program or a portion of it, +either verbatim or with modifications and/or translated into another +language. (Hereinafter, translation is included without limitation in +the term "modification".) Each licensee is addressed as "you". + +Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running the Program is not restricted, and the output from the Program +is covered only if its contents constitute a work based on the +Program (independent of having been made by running the Program). +Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's +source code as you receive it, in any medium, provided that you +conspicuously and appropriately publish on each copy an appropriate +copyright notice and disclaimer of warranty; keep intact all the +notices that refer to this License and to the absence of any warranty; +and give any other recipients of the Program a copy of this License +along with the Program. + +You may charge a fee for the physical act of transferring a copy, and +you may at your option offer warranty protection in exchange for a fee. + + 2. You may modify your copy or copies of the Program or any portion +of it, thus forming a work based on the Program, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b) You must cause any work that you distribute or publish, that in + whole or in part contains or is derived from the Program or any + part thereof, to be licensed as a whole at no charge to all third + parties under the terms of this License. + + c) If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display an + announcement including an appropriate copyright notice and a + notice that there is no warranty (or else, saying that you provide + a warranty) and that users may redistribute the program under + these conditions, and telling the user how to view a copy of this + License. (Exception: if the Program itself is interactive but + does not normally print such an announcement, your work based on + the Program is not required to print an announcement.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Program, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Program, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Program. + +In addition, mere aggregation of another work not based on the Program +with the Program (or with a work based on the Program) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, +under Section 2) in object code or executable form under the terms of +Sections 1 and 2 above provided that you also do one of the following: + + a) Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of Sections + 1 and 2 above on a medium customarily used for software interchange; or, + + b) Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a medium + customarily used for software interchange; or, + + c) Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with such + an offer, in accord with Subsection b above.) + +The source code for a work means the preferred form of the work for +making modifications to it. For an executable work, complete source +code means all the source code for all modules it contains, plus any +associated interface definition files, plus the scripts used to +control compilation and installation of the executable. However, as a +special exception, the source code distributed need not include +anything that is normally distributed (in either source or binary +form) with the major components (compiler, kernel, and so on) of the +operating system on which the executable runs, unless that component +itself accompanies the executable. + +If distribution of executable or object code is made by offering +access to copy from a designated place, then offering equivalent +access to copy the source code from the same place counts as +distribution of the source code, even though third parties are not +compelled to copy the source along with the object code. + + 4. You may not copy, modify, sublicense, or distribute the Program +except as expressly provided under this License. Any attempt +otherwise to copy, modify, sublicense or distribute the Program is +void, and will automatically terminate your rights under this License. +However, parties who have received copies, or rights, from you under +this License will not have their licenses terminated so long as such +parties remain in full compliance. + + 5. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Program or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Program (or any work based on the +Program), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the +Program), the recipient automatically receives a license from the +original licensor to copy, distribute or modify the Program subject to +these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties to +this License. + + 7. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Program at all. For example, if a patent +license would not permit royalty-free redistribution of the Program by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Program. + +If any portion of this section is held invalid or unenforceable under +any particular circumstance, the balance of the section is intended to +apply and the section as a whole is intended to apply in other +circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system, which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 8. If the distribution and/or use of the Program is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Program under this License +may add an explicit geographical distribution limitation excluding +those countries, so that distribution is permitted only in or among +countries not thus excluded. In such case, this License incorporates +the limitation as if written in the body of this License. + + 9. The Free Software Foundation may publish revised and/or new versions +of the General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + +Each version is given a distinguishing version number. If the Program +specifies a version number of this License which applies to it and "any +later version", you have the option of following the terms and conditions +either of that version or of any later version published by the Free +Software Foundation. If the Program does not specify a version number of +this License, you may choose any version ever published by the Free Software +Foundation. + + 10. If you wish to incorporate parts of the Program into other free +programs whose distribution conditions are different, write to the author +to ask for permission. For software which is copyrighted by the Free +Software Foundation, write to the Free Software Foundation; we sometimes +make exceptions for this. Our decision will be guided by the two goals +of preserving the free status of all derivatives of our free software and +of promoting the sharing and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY +FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN +OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES +PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED +OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS +TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE +PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, +REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR +REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, +INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING +OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED +TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY +YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER +PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE +POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +convey the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA + + +Also add information on how to contact you by electronic and paper mail. + +If the program is interactive, make it output a short notice like this +when it starts in an interactive mode: + + Gnomovision version 69, Copyright (C) year name of author + Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, the commands you use may +be called something other than `show w' and `show c'; they could even be +mouse-clicks or menu items--whatever suits your program. + +You should also get your employer (if you work as a programmer) or your +school, if any, to sign a "copyright disclaimer" for the program, if +necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the program + `Gnomovision' (which makes passes at compilers) written by James Hacker. + + , 1 April 1989 + Ty Coon, President of Vice + +This General Public License does not permit incorporating your program into +proprietary programs. If your program is a subroutine library, you may +consider it more useful to permit linking proprietary applications with the +library. If this is what you want to do, use the GNU Library General +Public License instead of this License. diff --git a/Setup.hs b/Setup.hs new file mode 100644 --- /dev/null +++ b/Setup.hs @@ -0,0 +1,2 @@ +import Distribution.Simple +main = defaultMain diff --git a/Text/ParserCombinators/Class.hs b/Text/ParserCombinators/Class.hs new file mode 100644 --- /dev/null +++ b/Text/ParserCombinators/Class.hs @@ -0,0 +1,101 @@ +{-# LANGUAGE TypeFamilies, NoMonomorphismRestriction #-} + +module Text.ParserCombinators.Class where +import Data.Char +import Control.Monad hiding (forM) +import Control.Applicative +import Data.Traversable + +-- | Parser class +class (Monad p, Alternative p) => IsParser p where + type SymbolOf p -- ^ Type of symbols processed + satisfy :: (SymbolOf p -> Bool) -> p (SymbolOf p) -- ^ accept a symbol satisfying a given predicate + look :: p [SymbolOf p] -- ^ access the stream of symbols from the current point + label :: String -> p a -> p a -- ^ label the parser + (<<|>) :: p a -> p a -> p a -- ^ Left-biased choice. + + +------------------------------------------------------------------------- +-- derived parsers + +infix 2 +infixr 3 <<|> + +-- | Label a parser +() :: IsParser p => p a -> String -> p a +p s = label s p + +char c = satisfy (==c) show [c] +noneOf cs = satisfy (\c -> not (c `elem` cs)) ("none of " ++ cs) +oneOf cs = satisfy (\c -> c `elem` cs) ("one of " ++ cs) + +spaces = skipMany space "white space" +space = satisfy isSpace "space" +newline = char '\n' "new-line" +tab = char '\t' "tab" +upper = satisfy isUpper "uppercase letter" +lower = satisfy isLower "lowercase letter" +alphaNum = satisfy isAlphaNum "letter or digit" +letter = satisfy isAlpha "letter" +digit = satisfy isDigit "digit" +hexDigit = satisfy isHexDigit "hexadecimal digit" +octDigit = satisfy isOctDigit "octal digit" + +anySymbol :: IsParser p => p (SymbolOf p) +anySymbol = satisfy (const True) + +string :: (IsParser p, SymbolOf p ~ Char) => String -> p String +string s = forM s char show s + +choice :: Alternative f => [f a] -> f a +choice ps = foldr (<|>) empty ps + +option :: Alternative f => a -> f a -> f a +option x p = p <|> pure x + +between :: Applicative m => m x -> m y -> m a -> m a +between open close p = open *> p <* close + +-- repetition +-- | Greedy repetition: match as many occurences as possible of the argument. +manyGreedy :: IsParser m => m a -> m [a] +manyGreedy p = do + x <- (Just <$> p) <<|> pure Nothing + case x of + Nothing -> return [] + Just y -> (y:) <$> manyGreedy p + +skipMany1 p = p *> skipMany p +skipMany p = let scan = (p *> scan) <|> pure () in scan + +sepBy p sep = sepBy1 p sep <|> pure [] +sepBy1 p sep = (:) <$> p <*> many (sep *> p) + +count :: Applicative m => Int -> m a -> m [a] +count n p = sequenceA (replicate n p) + +chainr p op x = chainr1 p op <|> return x +chainl p op x = chainl1 p op <|> return x + +chainr1 p op = scan + where + scan = do x <- p; rest x + rest x = (do f <- op; y <- scan; return (f x y)) <|> return x + +chainl1 p op = scan + where + scan = do x <- p; rest x + rest x = (do f <- op; y <- p; rest (f x y)) <|> return x + +munch,munch1 :: IsParser m => (SymbolOf m -> Bool) -> m [SymbolOf m] +munch p = scan =<< look + where + scan (c:cs) | p c = (:) <$> anySymbol <*> scan cs + scan _ = pure [] + +munch1 p = (:) <$> satisfy p <*> munch p + +endOfFile = label "end of file" $ do + s <- look + guard (null s) + diff --git a/Text/ParserCombinators/Parsek.hs b/Text/ParserCombinators/Parsek.hs new file mode 100644 --- /dev/null +++ b/Text/ParserCombinators/Parsek.hs @@ -0,0 +1,308 @@ +{-# LANGUAGE RankNTypes, MultiParamTypeClasses, TypeFamilies, FlexibleContexts #-} +-- | +-- +-- Module : Parsek +-- Copyright : Koen Claessen 2003 +-- License : GPL +-- +-- Maintainer : JP Bernardy +-- Stability : provisional +-- Portability : portable +-- +-- This module provides the /Parsek/ library developed by Koen Claessen in his +-- functional pearl article /Parallel Parsing Processes/, Journal of Functional +-- Programming, 14(6), 741–757, Cambridge University Press, 2004: +-- +-- +-- +-- +-- +-- + +module Text.ParserCombinators.Parsek + -- basic parser type + ( Parser -- :: * -> * -> *; Functor, Monad, MonadPlus + , Expect -- :: *; = [String] + + , module Text.ParserCombinators.Class + + -- parsing & parse methods + , ParseMethod + , ParseResult + , mapErrR + , parseFromFile + , parse + + , shortestResult + , longestResult + , longestResults + , allResults + , allResultsStaged + , completeResults + + , shortestResultWithLeftover + , longestResultWithLeftover + , longestResultsWithLeftover + , allResultsWithLeftover + + , module Control.Applicative + , module Control.Monad + -- , completeResultsWithLine -- :: ParseMethod Char a Int [a] + ) + where + +import Prelude hiding (exp,pred) +import Data.Maybe (listToMaybe) +import Control.Applicative +import Control.Monad + ( MonadPlus(..) + , forM_ + , guard + , ap + ) +import Text.ParserCombinators.Class + +------------------------------------------------------------------------- +-- type Parser + +newtype Parser s a + = Parser (forall res. (a -> Expect s -> P s res) -> Expect s -> P s res) + +-- | Parsing processes +data P s res + = Skip Int (P s res) -- ^ skip ahead a number of symbols. At end of file, no effect. + | Look ([s] -> P s res) + | Fail (Err s) + | Result res (P s res) + | Kill (P s res) -- ^ This is a high priority process trying to kill a low-priority one. See <<|>. + +-- | Suppress 1st kill instruction +noKill :: P s a -> P s a +noKill (Skip n p) = Skip n (noKill p) +noKill (Look fut) = Look $ noKill . fut +noKill (Fail e) = Fail e +noKill (Result res p) = Result res (noKill p) +noKill (Kill p) = p + +skip :: Int -> P s a -> P s a +skip 0 = id +skip n = Skip n + +-- The boolean indicates how to interpret 'Kill' instructions. If +-- 'True', the lhs process has a high priority and will kill the rhs +-- when it reaches its Kill instruction (otherwise it fails). If +-- 'False', then both processes have the same priority, and 'Kill' +-- instructions are just propagated. +plus' :: Bool -> P s res -> P s res -> P s res +plus' hasKiller p0 q0 = plus p0 q0 where + noKill' = if hasKiller then noKill else id + Kill p `plus` q | hasKiller = p + | otherwise = Kill $ p `plus` noKill q + p `plus` Kill q | hasKiller = error "plus': Impossible" + | otherwise = Kill $ noKill p `plus` q + Skip m p `plus` Skip n q | m <= n = Skip m $ p `plus` skip (n-m) q + | otherwise = Skip n $ skip (m-n) p `plus` skip n q + Fail err1 `plus` Fail err2 = Fail (err1 ++ err2) + p `plus` Result res q = Result res (p `plus` q) + Result res p `plus` q = Result res (p `plus` q) + Look fut1 `plus` Look fut2 = Look (\s -> fut1 s `plus` fut2 s) + Look fut1 `plus` q = Look (\s -> fut1 s `plus` q) + p `plus` Look fut2 = Look (\s -> p `plus` fut2 s) + p@(Skip _ _) `plus` _ = noKill' p + _ `plus` q@(Skip _ _) = q + +type Err s = [(Expect s, -- we expect this stuff + String -- but failed for this reason + )] + +-- | An intersection (nesting) of things currently expected +type Expect s = [(String, -- Expect this + Maybe s -- Here + )] + +------------------------------------------------------------------------- +-- instances + +instance Functor (Parser s) where + fmap p (Parser f) = + Parser (\fut -> f (fut . p)) + +instance Monad (Parser s) where + return a = Parser (\fut -> fut a) + + Parser f >>= k = + Parser (\fut -> f (\a -> let Parser g = k a in g fut)) + + fail s = Parser (\_fut exp -> Fail [(exp,s)]) + +instance MonadPlus (Parser s) where + mzero = Parser (\_fut exp -> Fail [(exp,"mzero")]) + + mplus (Parser f) (Parser g) = + Parser (\fut exp -> plus' False (f fut exp) (g fut exp)) + +instance Applicative (Parser s) where + pure = return + (<*>) = ap + +instance Alternative (Parser s) where + (<|>) = mplus + empty = mzero + +instance IsParser (Parser s) where + type SymbolOf (Parser s) = s + satisfy pred = + Parser $ \fut exp -> Look $ \xs -> case xs of + (c:_) | pred c -> Skip 1 $ fut c exp + _ -> Fail [(exp,"satisfy")] + + look = Parser $ \fut exp -> Look $ \s -> fut s exp + + label msg (Parser f) = + Parser $ \fut exp -> + Look $ \xs -> + f (\a _ -> fut a exp) -- drop the extra expectation in the future + ((msg,listToMaybe xs):exp) -- locally have an extra expectation + + Parser f <<|> Parser g = Parser $ \fut exp -> + plus' True (f (\a x -> Kill (fut a x)) exp) (g fut exp) + +------------------------------------------------------------------------- +-- type ParseMethod, ParseResult + +type ParseMethod s a r = P s a -> [s] -> ParseResult s r + +type ParseResult s r + = Either (Err s) r + +mapErrR :: (s -> s') -> ParseResult s r -> ParseResult s' r +mapErrR _ (Right x) = Right x +mapErrR f (Left x) = Left (mapErr f x) + +first f (a,b) = (f a,b) +second f (a,b) = (a, f b) + +mapErr :: (a -> b) -> Err a -> Err b +mapErr f = map (first (mapExpect f)) + +mapExpect :: (a -> b) -> Expect a -> Expect b +mapExpect f = map (second (fmap f)) + +-- parse functions + +parseFromFile :: Parser Char a -> ParseMethod Char a r -> FilePath -> IO (ParseResult Char r) +parseFromFile p method file = + do s <- readFile file + return (parse p method s) + +parse :: Parser s a -> ParseMethod s a r -> [s] -> ParseResult s r +parse (Parser f) method xs = method (f (\a _exp -> Result a (Fail [])) []) xs + +-- parse methods +shortestResult :: ParseMethod s a a +shortestResult = scan + where + scan (Skip n p) xs = scan p (drop n xs) + scan (Result res _) _ = Right res + scan (Fail err) _ = Left err + scan (Look f) xs = scan (f xs) xs + +longestResult :: ParseMethod s a a +longestResult p0 = scan p0 Nothing + where + scan (Skip n p) mres xs = scan p mres (drop n xs) + scan (Result res p) _ xs = scan p (Just res) xs + scan (Fail err) Nothing _ = Left err + scan (Fail _ ) (Just res) _ = Right res + scan (Look f) mres xs = scan (f xs) mres xs + +longestResults :: ParseMethod s a [a] +longestResults p0 = scan p0 [] [] + where + scan (Skip n p) [] old xs = scan p [] old (drop n xs) + scan (Skip n p ) new old xs = scan p [] new (drop n xs) + scan (Result res p) new old xs = scan p (res:new) [] xs + scan (Fail err) [] [] _ = Left err + scan (Fail _) [] old _ = Right old + scan (Fail _) new _ _ = Right new + scan (Look f) new old xs = scan (f xs) new old xs + +allResultsStaged :: ParseMethod s a [[a]] +allResultsStaged p0 xs0 = Right (scan p0 [] xs0) + where + scan (Skip n p) ys xs = ys : scan p [] (drop n xs) + scan (Result res p) ys xs = scan p (res:ys) xs + scan (Fail _) ys _ = [ys] + scan (Look f) ys xs = scan (f xs) ys xs + +allResults :: ParseMethod s a [a] +allResults = scan + where + scan (Skip n p) xs = scan p (drop n xs) + scan (Result res p) xs = Right (res : scan' p xs) + scan (Fail err) _ = Left err + scan (Look f) xs = scan (f xs) xs + + scan' p xs = + case scan p xs of + Left _ -> [] + Right ress -> ress + +completeResults :: ParseMethod s a [a] +completeResults = scan + where + scan (Skip n p) xs = scan p (drop n xs) + scan (Result res p) [] = Right (res : scan' p []) + scan (Result _ p) xs = scan p xs + scan (Fail err) _ = Left err + scan (Look f) xs = scan (f xs) xs + + scan' p xs = + case scan p xs of + Left _ -> [] + Right ress -> ress + +-- with left overs + +shortestResultWithLeftover :: ParseMethod s a (a,[s]) +shortestResultWithLeftover = scan + where + scan (Skip n p) xs = scan p (drop n xs) + scan (Result res _) xs = Right (res,xs) + scan (Fail err) _ = Left err + scan (Look f) xs = scan (f xs) xs + +longestResultWithLeftover :: ParseMethod s a (a,[s]) +longestResultWithLeftover p0 = scan p0 Nothing + where + scan (Skip n p) mres xs = scan p mres (drop n xs) + scan (Result res p) _ xs = scan p (Just (res,xs)) xs + scan (Fail err) Nothing _ = Left err + scan (Fail _) (Just resxs) _ = Right resxs + scan (Look f) mres xs = scan (f xs) mres xs + +longestResultsWithLeftover :: ParseMethod s a ([a],Maybe [s]) +longestResultsWithLeftover p0 = scan p0 empty empty + where + scan (Skip n p) ([],_) old xs = scan p empty old $ drop n xs + scan (Skip n p) new _ xs = scan p empty new $ drop n xs + scan (Result res p) (as,_) _ xs = scan p (res:as,Just xs) empty xs + scan (Fail err) ([],_) ([],_) _ = Left err + scan (Fail _) ([],_) old _ = Right old + scan (Fail _) new _ _ = Right new + scan (Look f) new old xs = scan (f xs) new old xs + + empty = ([],Nothing) + +allResultsWithLeftover :: ParseMethod s a [(a,[s])] +allResultsWithLeftover = scan + where + scan (Skip n p) xs = scan p $ drop n xs + scan (Result res p) xs = Right ((res,xs) : scan' p xs) + scan (Fail err) [] = Left err + scan (Look f) xs = scan (f xs) xs + + scan' p xs = + case scan p xs of + Left _ -> [] + Right ress -> ress diff --git a/Text/ParserCombinators/Parsek/Position.hs b/Text/ParserCombinators/Parsek/Position.hs new file mode 100644 --- /dev/null +++ b/Text/ParserCombinators/Parsek/Position.hs @@ -0,0 +1,81 @@ +{-# LANGUAGE RankNTypes, TypeFamilies, GeneralizedNewtypeDeriving #-} + +-- Module : Text.ParserCombinators.Parsek +-- Copyright : Koen Claessen 2003 +-- License : GPL +-- +-- Maintainer : JP Bernardy +-- Stability : provisional +-- Portability : portable +-- +-- This module provides the /Parsek/ library developed by Koen Claessen in his +-- functional pearl article /Parallel Parsing Processes/, Journal of Functional +-- Programming, 14(6), 741–757, Cambridge University Press, 2004: + +module Text.ParserCombinators.Parsek.Position + ( module Text.ParserCombinators.Parsek + , module Text.ParserCombinators.Class + , SourcePos(..) + , Parser + , getPosition + , parse + , parseFromFile + , maybePosToPos + , anyChar + ) where + +import Text.ParserCombinators.Class +import Text.ParserCombinators.Parsek hiding (parse,parseFromFile,Parser) +import qualified Text.ParserCombinators.Parsek as P +import Data.Bits + +newtype Parser a = PP (P.Parser (Char, SourcePos) a) + deriving (Alternative, Applicative, Monad, Functor, MonadPlus) + +instance IsParser Parser where + type SymbolOf Parser = Char + satisfy p = PP $ fst <$> satisfy (p . fst) + look = PP $ (map fst) <$> look + label lab (PP p) = PP (label lab p) + (PP p) <<|> (PP q) = PP (p <<|> q) + +anyChar :: IsParser p => p (SymbolOf p) +anyChar = anySymbol + +getPosition :: Parser SourcePos +getPosition = PP $ (\l -> case l of + [] -> EOF + ((_,p):_) -> p) <$> look + +parse :: FilePath -> Parser a -> (forall s. ParseMethod s a r) -> String -> ParseResult SourcePos r +parse file (PP p) method s = mapErrR snd $ P.parse p method (zip s (scanl updLoc (initLoc file) s)) + +parseFromFile :: Parser a -> (forall s. ParseMethod s a r) -> FilePath -> IO (ParseResult SourcePos r) +parseFromFile p method file = parse file p method <$> readFile file + +maybePosToPos = maybe EOF id + +------------- +-- Locations + +data SourcePos = Loc {sourceName :: !FilePath, sourceLine :: !Int, sourceCol :: !Int} | EOF + deriving (Ord,Eq) + +instance Show SourcePos where + show EOF = "end of file" + show (Loc f l c) = f ++ ":" ++ show l ++ ":" ++ show c + + +updLoc :: SourcePos -> Char -> SourcePos +updLoc (Loc f l _) '\n' = Loc f (l+1) 0 +updLoc (Loc f l c) '\t' = Loc f l ((c+8) .&. complement 7) +updLoc (Loc f l c) _ = Loc f l (c+1) +updLoc EOF _ = EOF + +initLoc :: FilePath -> SourcePos +initLoc p = Loc p 1 0 + + + + + diff --git a/parsek.cabal b/parsek.cabal new file mode 100644 --- /dev/null +++ b/parsek.cabal @@ -0,0 +1,25 @@ +name: parsek +version: 1.0.0 +category: Parsing +synopsis: Parallel Parsing Processes +description: Koen Claessen's PPP, Modified. +license: GPL +license-file: LICENSE +author: Koen Claessen, Jean-Philippe Bernardy +maintainer: jeanphilippe.bernardy@gmail.com +Cabal-Version: >= 1.12 +build-type: Simple + +library + default-language: Haskell2010 + build-depends: base==4.* + + exposed-modules: + Text.ParserCombinators.Class + Text.ParserCombinators.Parsek + Text.ParserCombinators.Parsek.Position + + + + +