News for hackers. Stuff that matters.
Re:What's in a Parser Combinator? (2016) by fuckface123 on Thursday May 28, 2020 @11:19PM (#23345956)
gracefully handling errors and giving useful output is the hardest part of writing parsers, why does everybody skip over that part?? :)
Re:What's in a Parser Combinator? (2016) by lalaithion on Friday May 29, 2020 @12:38AM (#23346309)
You can get parsing stacktraces by changing the definition of Parser to

    data Parser a c = Parser { runParser :: String -> Either [c] (a, String) }
and adding a combinator

    withContext c p = Parser \s -> case runParser p of
      Left stackTrace = Left (c:stackTrace)
      Right x = Right x
This allows you to write stuff like

    number = withContext "parsing a number" $ ...
    addition = withContext "parsing addition expression" $ ...
    expr = withContext "parsing a mathematical expression" $ ...
and combine that with a technique that keeps track of where you are in the string when failure occurs, you can pretty print that to something like:

Failed to parse!

    2 + 34.0O4
            ^
While: parsing a number

While: parsing addition expression

While: parsing a mathematical expression

Re:What's in a Parser Combinator? (2016) by mathgladiator on Friday May 29, 2020 @01:22AM (#23346513)
So, one of the key things that I see is that the constructed abstract syntax tree must have the raw tokens within it so all other layers have full awareness.

I feel the criticism is valid because most parsers in production are done via hand without tooling or fancy techniques.

Re:What's in a Parser Combinator? (2016) by ookdatnog on Friday May 29, 2020 @09:14AM (#23349568)
> So, one of the key things that I see is that the constructed abstract syntax tree must have the raw tokens within it so all other layers have full awareness.

I don't see why you say that, parser combinators are just a structured way to compose recursive descent parsers, you can do everything with them that you can with any other hand-rolled parser. You don't even need to construct an AST at all, a mathematical expression "parser combinator" could just return a single number, the result of evaluating the expression.

Re:What's in a Parser Combinator? (2016) by Quekid5 on Friday May 29, 2020 @05:36AM (#23348029)
> most parsers in production are done via hand without tooling or fancy techniques.

What? Do you have any data you'd like to share?

I'm given to understand that e.g. the C++ compilers usually have a hand-coded, but AFAIUI that's mostly due to the complexity of actually parsing it (and fitting that into anything other than just raw code).

Re:What's in a Parser Combinator? (2016) by mathgladiator on Friday May 29, 2020 @06:04AM (#23348185)
only anecdotal and observations over the years

https://www.drdobbs.com/architecture-and-design/so-you-want-...

A common theme is that the parser generator does not provide you the tools to write the high quality error messages. Having used ANTLR and other tools, I believe it now that I'm trying to ship a real language.

Re:What's in a Parser Combinator? (2016) by Quekid5 on Friday May 29, 2020 @03:04PM (#23354185)
You're talking about parser generators... the article is about parser combinators. Fully agreed that parser generators are often very limited and often require hacks to do anything non-trivial.

(IME MegaParsec basically solves most of the issues.)

Re:What's in a Parser Combinator? (2016) by wwright on Friday May 29, 2020 @09:08AM (#23349494)
Python 3.9 is actually switching to a PEG :)
Re:What's in a Parser Combinator? (2016) by yellowapple on Thursday May 28, 2020 @11:56PM (#23346122)
Agreed, and it's disappointing that you got downvoted to oblivion for raising a valid point. There is an abundance of articles on parser combinators and grammars and other theoretical parsing concepts, and a dearth of articles (AFAICT) on actual practical applications or graceful error handling.

I suspect the difficulty of error handling or parsing a non-trivial language are exactly why few articles cover them. Crafting Interpreters¹ seems to be a notable exception here.

----

¹: https://www.craftinginterpreters.com/parsing-expressions.htm...

Re:What's in a Parser Combinator? (2016) by whateveracct on Friday May 29, 2020 @01:03AM (#23346433)
Mega parsec is a parser combinator library that definitely satisfies these requirements.

In fact, I would say Haskell-style parser combinators are the best way to satisfy those requirements in general.

Re:What's in a Parser Combinator? (2016) by madushan1000 on Friday May 29, 2020 @12:53AM (#23346375)
Checkout Munch[1], it has full error handling and fully functioning, the tutorial is long and sometimes hard to follow though.

[1] http://nbloomf.blog/munch/munch.html

Re:What's in a Parser Combinator? (2016) by BoiledCabbage on Friday May 29, 2020 @12:35AM (#23346290)
Anyone know how Elm does it? Elm is incredible. It should be the gold standard any compiler strives for is quality of messages.
Re:What's in a Parser Combinator? (2016) by saagarjha on Friday May 29, 2020 @03:21AM (#23347136)
I don’t know much about Elm, but one of the few things I have heard of is this GitHub issue: https://github.com/elm/compiler/issues/1773. Am I putting too much emphasis on this particular picked cherry or does the compiler do this in general?
Re:What's in a Parser Combinator? (2016) by hawski on Friday May 29, 2020 @07:07AM (#23348566)
It seems that instead of fixing it it is an error now [0]. This and the comment from the issue [1] do not inspire confidence in me.

[0] https://github.com/elm/compiler/commit/0e669b8ad076f64e450f2...

[1] https://github.com/elm/compiler/issues/1773#issuecomment-418... the same on master