About 2,480,000 results
Open links in new tab
  1. Using Parsec to parse regular expressions - Stack Overflow

    Jan 26, 2012 · 13 You should use Parsec.Expr.buildExprParser; it is ideal for this purpose. You simply describe your operators, their precedence and associativity, and how to parse an atom, …

  2. Right way to parse chain of various binary functions with `Parsec`?

    Jun 10, 2019 · It is true that Parsec has chainl and chainr to parse chains of either left-associative or right-associative operations (i.e. a -> a -> a). So I could quite easily parse something …

  3. Simply using parsec in python - Stack Overflow

    Aug 6, 2019 · The design of parsec requires a Parser to act independently on an input stream without knowledge of any other Parser. To do this effectively a Parser must manage an index …

  4. Parsec Connection Failure Error -10 and -11 - Stack Overflow

    Oct 19, 2021 · Parsec Connection Failure Error -10 and -11 Asked 4 years ago Modified 4 years ago Viewed 3k times

  5. ghc error: hidden package, but it's actually exposed

    parsec-3.1.14.0 is not the same package as parsec-3.1.13.0. Something else is going on. How did you install the package? What environment are you running ghc in? What's the full output of …

  6. parsing - Parsec `try` should backtrack - Stack Overflow

    Sep 5, 2022 · Isn't Parsec's try supposed to backtrack when it encounters failure? For instance, if I have the code import Control.Applicative ((<|>)) import Debug.Trace import Text.Parsec …

  7. Parsec vs Yacc/Bison/Antlr: Why and when to use Parsec?

    Feb 21, 2011 · My understanding is that Parsec creates a nice DSL of writing parsers and Haskell makes it very easy and expressive. But parsing is such a standard/popular technology that …

  8. Parsec: difference between "try" and "lookAhead"?

    Nov 16, 2013 · The combinators try and lookAhead are similar in that they both let Parsec "rewind", but they apply in different circumstances. In particular, try rewinds failure while …

  9. Writing a parser from scratch in Haskell - Stack Overflow

    Dec 18, 2013 · It's actually surprisingly easy to build Parsec-from-scratch. The actual library code itself is heavily generalized and optimized which contorts the core abstraction, but if you're just …

  10. What's the cleanest way to do case-insensitive parsing with Text ...

    No, Parsec cannot do that in clean way. string is implemented on top of primitive tokens combinator that is hard-coded to use equality test (==). It's a bit simpler to parse case …