Parboiled2 VS Fast Parse

Compare Parboiled2 vs Fast Parse and see what are their differences.

Parboiled2

A macro-based PEG parser generator for Scala 2.10+ (by sirthias)
#Parsing
Source Code

Fast Parse

Writing Fast Parsers Fast in Scala (by lihaoyi)
#Parsing
Source Code
com-lihaoyi.github.io
Our great sponsors
  • Scout APM - Less time debugging, more time building
  • SonarLint - Deliver Cleaner and Safer Code - Right in Your IDE of Choice!
  • SaaSHub - Software Alternatives and Reviews
Our great sponsors
Parboiled2 Fast Parse
1 2
685 990
- 0.2%
8.6 3.8
20 days ago 26 days ago
Scala Scala
GNU General Public License v3.0 or later MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

Parboiled2

Posts with mentions or reviews of Parboiled2. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-01-12.

Fast Parse

Posts with mentions or reviews of Fast Parse. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-12-17.
  • -🎄- 2021 Day 18 Solutions -🎄-
    144 projects | reddit.com/r/adventofcode | 17 Dec 2021
    Mostly a mess of pattern matching. I really need to make some generic tree utilities. Haven't been able to find a decent parser combinator that works in Scala 3 (I usually use fastparse which depends heavily on Scala 2 macros, and scala-parser-combinators works in Scala 3, but I've had a lot of trouble getting it to not be too greedy), so I used the state monad from cats to parse at the bottom of the file, which I think turned out fairly nice.
  • Parser generators vs. handwritten parsers: surveying major languages in 2021
    11 projects | news.ycombinator.com | 21 Aug 2021
    Agreed! I would say that parser combinators are the sweet spot and the right choice in most cases.

    Scala has them as well, e.g.: https://com-lihaoyi.github.io/fastparse/

    And the good thing is, you don't have to learn a completely new language/syntax, you can use the host language's syntax and you have full IDE support as well.

What are some alternatives?

When comparing Parboiled2 and Fast Parse you can also consider the following projects:

Scala Parser Combinators - simple combinator-based parsing for Scala. formerly part of the Scala standard library, now a separate community-maintained module

atto - friendly little parsers

Kaitai Struct - Kaitai Struct: declarative language to generate binary data parsers in C++ / C# / Go / Java / JavaScript / Lua / Perl / PHP / Python / Ruby

Scopt - command line options parsing for Scala

Scallop - a simple Scala CLI parsing library

Lark - Lark is a parsing toolkit for Python, built with a focus on ergonomics, performance and modularity.

decline - A composable command-line parser for Scala.

CLIST - Command Line Interface Scala Toolkit

Fast Parse vs Scala Parser Combinators
Fast Parse vs atto
Fast Parse vs Kaitai Struct
Fast Parse vs Scopt
Parboiled2 vs Scala Parser Combinators
Parboiled2 vs Scopt
Parboiled2 vs Scallop
Fast Parse vs Scallop
Fast Parse vs Lark
Fast Parse vs decline
Parboiled2 vs atto
Fast Parse vs CLIST