python-gedcom
Python module for parsing, analyzing, and manipulating GEDCOM files (by joeyaurel)
Lark
Lark is a parsing toolkit for Python, built with a focus on ergonomics, performance and modularity. (by lark-parser)
python-gedcom | Lark | |
---|---|---|
1 | 35 | |
155 | 4,802 | |
- | 1.2% | |
6.2 | 8.0 | |
9 months ago | 13 days ago | |
Python | Python | |
GNU General Public License v3.0 only | 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.
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.
python-gedcom
Posts with mentions or reviews of python-gedcom.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-11-29.
-
What is your personal pet project that you are working on/want to work on?
I'm using nickreynke's python-gedcom as the gedcom parser: https://github.com/nickreynke/python-gedcom
Lark
Posts with mentions or reviews of Lark.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-08-13.
-
Show HN: I wrote a RDBMS (SQLite clone) from scratch in pure Python
Lark supports, and recommends, writing and storing the grammar in a .lark file. We have syntax highlighting support in all major IDEs, and even in github itself. For example, here is Lark's built-in grammar for Python: https://github.com/lark-parser/lark/blob/master/lark/grammar...
You can also test grammars "live" in our online IDE: https://www.lark-parser.org/ide/
The rationale is that it's more terse and has less visual clutter than a DSL over Python, which makes it easier to read and write.
-
Oops, I wrote yet another SQLAlchemy alternative (looking for contributors!)
First, let me introduce myself. My name is Erez. You may know some of the Python libraries I wrote in the past: Lark, Preql and Data-diff.
-
Hey guys, have any of you tried creating your own language using Python? I'm interested in giving it a shot and was wondering if anyone has any tips or resources to recommend. Thanks in advance!
It's not super maintained but you might enjoy building something with ppci, Pure Python Compiler Infrastructure. It has some front-ends and some back-ends. There's also PeachPy for an assembler. People like using Lark for parsing, I hear.
-
Is it possible to propagate higher level constructs (+, *) to the generated parse tree in an LR-style parser?
lark, a parsing library where I am somewhat involved has a really nice solution to this: Rules starting with _ are inlined in a post processing step.
-
can you create your own program language in python, if yes how?
Lark is a good library to assist with this.
- Lark a Python lexer/parser library
-
Create your own scripting language in Python with Sly
If I may ask, did you consider Lark, and if so, why wasn't it fit for your purposes?
- Creating a language with Python.
-
Not Your Grandfather’s Perl
A grammar provides the high level constructs you need to define the "shape" of your data, and it largely takes care of the rest. Grammar libraries exist in other language (eg. lark or Parsimonius in Python) and they weren't created just to make XML parsing easier.
-
Earley Parsing Explained
I made a solid attempt at an Earley parser framework of my own, but apparently to get the most reliable performance from Earley parsing you need to implement Joop Leo's improvement for right-recursive grammars, which nobody has been able to adequately explain to me. I've read Kegler's open letter to Vaillant, I've tried to read other implementations, I've even tried to beat my head against the original academic paper, but I don't have the background knowledge to make sense of it all.