pyparsing
parser
Our great sponsors
| pyparsing | parser | |
|---|---|---|
| 13 | 4 | |
| 2,083 | 5 | |
| 1.6% | - | |
| 8.5 | 6.6 | |
| 17 days ago | 4 days ago | |
| Python | TypeScript | |
| MIT License | MIT License |
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.
pyparsing
-
About a month ago I posted about PRegEx, an open-source project which I had started that you can use to build RegEx patterns programmatically, which the subreddit seem to like. This prompted me to keep working on it, and one month later, PRegEx v2.0.0 is out!
I havent found a way to specify an exact character match in pyparsing - https://github.com/pyparsing/pyparsing/discussions/443
-
Python toolkits
STDOUT: Lark or pyparsing
- TatSu takes grammars in variation of EBNF, outputs memoizing Python PEG parsers
-
Parser Combinators in Haskell
Since it is not mentioned in the article: Python users may also want to check out pyparsing [0]. It is slightly different from Parsec/FParsec (for instance, it ignores all whitespace by default), but I think it is a really good project.
- luna is a Domain specific language that translates to regex. It's an attempt to make regex more readable.
-
Recommended way to read and parse a couple thousand small files
I might try to use multiprocessing for comparison. I'm using pyparsing for the parsing, although it probably could be done with regex.
Your pyparsing parser might benefit from a tune-up. This page has some performance tips: https://github.com/pyparsing/pyparsing/wiki/Performance-Tips.
parser
-
Ramda: A practical functional library for JavaScript programmers
I find straight forward, dedicated combinators much more readable and practical to use ie. for iterables (context where it makes a lot of sense) [0] example [1], runtime assertions (through refutations, which are much faster than combinators over assertions) [2], parser combinators for smallish grammars [3] etc.
In many cases vanilla/imperative js is more readable and terse, no need to bring functional fanaticism everywhere, just in places where it gives true benefits and in form that can be understood by peers.
Functional code can be beautiful and can also be unreadable/undebugable. Same with imperative code. It's great in js/ts you can pick approach where the problem is expressed more naturally and mix it at will.
[0] https://github.com/preludejs/generator
[1] https://observablehq.com/@mirek/project-euler
-
Parsing Text with Nom
Parser combinators are great, we're using parser combinators in production, they are great ie. for typescript [0].
- Parser Combinators in Haskell
- Casual Parsing in JavaScript
What are some alternatives?
instaparse
parsita - The easiest way to parse text in Python
iregex - A way to write regex with objects instead of strings.
attoparsec - A fast Haskell library for parsing ByteStrings
sly - Sly Lex Yacc
Lark - Lark is a parsing toolkit for Python, built with a focus on ergonomics, performance and modularity.
assert-combinators - Functional assertion combinators.
ReadableRegex.jl - regexes for people who don't really want to learn or read regexes
uwsgi-nginx-flask-docker - Docker image with uWSGI and Nginx for Flask applications in Python running in a single container.
parser-combinators - Parser combinators.
three-pass-compiler - Solution to the Three Pass Compiler kata on CodeWars, parsing and manipulating a very simple AST