/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 andreabergia.com
Playing with Nom and parser combinators ยท Andrea Bergia's Website
| | tyrrrz.me
Monadic Parser Combinators in C# Oleksii Holub
1.8 parsecs away

Travel
| | A while ago I had to implement proper markdown parsing in DiscordChatExporter so that I could replace the brittle regular expressions I had been using. I had no idea how to approach this problem, so I spent days researching into this, eventually learning...
| | arunraghavan.net
Applicative Functors for Fun and Parsing - Arun Raghavan
2.7 parsecs away

Travel
| |
| | fsharpforfunandprofit.com
Building a useful set of parser combinators | F# for fun and profit
2.0 parsecs away

Travel
| | 15 or so combinators that can be combined to parse almost anything
| | www.engr.mun.ca
Parsing Expressions by Recursive Descent
12.3 parsecs away

Travel
| [AI summary] The text provides a detailed explanation of the precedence climbing algorithm, a method for parsing expressions with operator precedence and associativity. It outlines the algorithm's development, its relation to recursive descent parsing and Pratt parsing, and its implementation in various programming languages and compilers. The text also includes historical context, references to key papers and authors, and acknowledgments for contributions to the algorithm's development.