nomeata,
@nomeata@mastodon.online avatar

At my talk at I claimed that with observable sharing one can write a parser combinator library where left-recursion works (in the presence of sharing), and someone asked if I had, and I had to admit I hadn’t, so the next day I did:
https://www.joachim-breitner.de/blog/807-Left_recursive_parser_combinators_via_sharing

ljrk,
@ljrk@todon.eu avatar

@nomeata This was really pleasant to read! I especially liked that you gave some background "thoughts" for details like:

> I somewhat sillily used snoc rather than (:) to build my lists, just so that I can show off all the left-recursion in this grammar.

This could easily have tripped me up due to not being that good in Haskell (anymore?) and thinking that this had some deeper relevance for the point to be made. Incredibly well-written!

d_christiansen,
@d_christiansen@mathstodon.xyz avatar

@nomeata looks like broken links here:

  • All
  • Subscribed
  • Moderated
  • Favorites
  • haskell
  • ngwrru68w68
  • rosin
  • GTA5RPClips
  • osvaldo12
  • love
  • Youngstown
  • slotface
  • khanakhh
  • everett
  • kavyap
  • mdbf
  • DreamBathrooms
  • thenastyranch
  • magazineikmin
  • anitta
  • InstantRegret
  • normalnudes
  • tacticalgear
  • cubers
  • ethstaker
  • modclub
  • cisconetworking
  • Durango
  • provamag3
  • tester
  • Leos
  • megavids
  • JUstTest
  • All magazines