pyparsing
angstrom
pyparsing | angstrom | |
---|---|---|
13 | 3 | |
2,100 | 616 | |
1.4% | 1.3% | |
8.3 | 0.0 | |
about 1 month ago | 4 months ago | |
Python | OCaml | |
MIT License | GNU General Public License v3.0 or later |
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
-
Pyparsing 3.1.0 released
After over a year since the last release of pyparsing, I've bundled up all the bug-fixes and changes, and they are now released as pyparsing 3.1.0. Visit this link for the details.
-
Need help developing an interpreter
Look into "parser combinators" for building an interpreter. There's a few ones out there, but PyParsing is one I've seen around that looks pretty nifty.
-
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.
[0]: https://github.com/pyparsing/pyparsing/
-
Pyparsing 3.0.x - off to a rocky start, but I think 3.0.6 looks fairly solid
Here is the page of all the new changes and features in pyparsing 3.0.
- 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
Your pyparsing parser might benefit from a tune-up. This page has some performance tips: https://github.com/pyparsing/pyparsing/wiki/Performance-Tips.
-
Script for extracting info from a SQL File
If your SQL has fairly complex structure, you will need a full blown SQL parser. If your statements are mostly simple select, you can get pretty close with Pyparsing, here is an example.
angstrom
-
Anyone have suggestions on how to parse recursive grammar elements with a parser generator?
Looking at the angstrom reference here I've explored a few ideas but none of them work.
- Parser Combinators in Haskell
-
Is Ocaml From the beginning a good book? Where to learn about multicore Ocaml? Is this a good project skeleton?
Do you specifically need an LR(1) parser? If you just need to do some simple parsing, a parser combinator library like Angstrom works fine and is completely defined in OCaml code: https://github.com/inhabitedtype/angstrom
What are some alternatives?
parsita - The easiest way to parse text in Python
ocaml-parsing - Boilerplate code for writing parsers in OCaml using Menhir + sedlex
parser - String parser combinators
comby - A code rewrite tool for structural search and replace that supports ~every language.
iregex - A way to write regex with objects instead of strings.
generator - Generator module.
attoparsec - A fast Haskell library for parsing ByteStrings
assert-combinators - Functional assertion combinators.
sly - Sly Lex Yacc
morbig - A static parser for POSIX Shell
Lark - Lark is a parsing toolkit for Python, built with a focus on ergonomics, performance and modularity.
multicore-opam - OPAM repo for OCaml multicore development