Understanding parser combinators: a deep dive - Scott Wlaschin

Поділитися
Вставка
  • Опубліковано 24 гру 2024

КОМЕНТАРІ • 19

  • @Avantarius
    @Avantarius 2 роки тому +18

    When looking at Haskellers explaining parser combinators you may think its rocket science... yet this guy explains it so anyone can understand it... and this stuff is actually easy!

  • @dazraf
    @dazraf 3 роки тому +15

    Chris is one of the modern legends of functional programming. Such a good communicator! Thanks Chris for the talk which inspired me to write my own PC. I then realised that a lot of systems programming could be reduced to a set of 'parsers' and combinators. Very powerful concept.

  • @abhishes
    @abhishes 7 років тому +9

    Thats a great talk. loved it!

  • @cshung
    @cshung 6 років тому +1

    Thank you for explaining!

  • @AdvancedSoul
    @AdvancedSoul 6 років тому +1

    Very helpful. Thanks!

  • @wuzixiao1
    @wuzixiao1 5 місяців тому

    Thanks, it is very helpful

  • @JohnDlugosz
    @JohnDlugosz 6 років тому +4

    I didn't see how he ignores the whitespace between all the other stuff.

  • @worldboy9684
    @worldboy9684 6 років тому +1

    Awesome

  • @bikerd12
    @bikerd12 2 роки тому

    Sample code and explanation get A++ grade.

  • @venkateswarans1012
    @venkateswarans1012 Рік тому

    Source code?

  • @vram288
    @vram288 3 місяці тому

    at 21.0 good

  • @MisterFanwank
    @MisterFanwank 4 роки тому +5

    This is just overly convoluted recursive descent by a snowflake name. The only thing exceptional here is how smug your recursion is.

    • @AndersJackson
      @AndersJackson 3 роки тому +17

      And this is an simple introduction to write that in a functional programming language. So what is the problem?

    • @seethruhead7119
      @seethruhead7119 2 роки тому +1

      someone thinks they're smarter than everyone else...smh

    • @GeorgeTsiros
      @GeorgeTsiros 2 роки тому

      @@seethruhead7119 everyone thinks they're smarter than anyone else
      that is what humans do.

    • @kiuhnmmnhuik2627
      @kiuhnmmnhuik2627 Рік тому +2

      ​@@AndersJackson FP may look overly convoluted to someone not used to it, because higher order functions are not easy to reason with, at first. Anyway, one can also implement combinators in an imperative language. If one represents parsers as trees of parsers, one can combine parsers by combining those trees.

    • @AndersJackson
      @AndersJackson Рік тому +2

      @@kiuhnmmnhuik2627 FP are easier to reason about, it is just that most common programming languages we introduce programming languages with are not FP.
      So it is all about what you are used to.