Система аналитики и презентации данных с учётом ограничений системы F
Система аналитики и презентации данных — мой проект, который я выполнял в рамках курсовых работ во время обучения в институте. Описал основные шаги, идеи и поделился своими успехами.
In which I have Opinions about parsing and grammars - by Simon Tatham
https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/parsing/
The tiny but complete #JSON #parser that I wrote in #Haskell years ago is now featured in the 200-and-change collection of programs by @dubroy: https://pdubroy.github.io/200andchange
Had an enjoyable afternoon building a custom #cli #parser to replace #argparse in our internal tooling. I like its ease of use. But it is a custom parser and works only for my specific use case, but for use case it does more than argparse can and is simpler to use. #comandline #python
I'm trying to write a formatter for a custom scripting language and left recrusion is really getting on my nerves. I'm using python's parsy library and I can't really solve how to parse the following example without causing the left recursion.
cells[col][row].clear(true);
#Development #Launches
ESLint can now lint HTML · The code linter delivers a new language plugin https://ilo.im/163v4b
_____
#ESLint #OpenSource #Coding #Linter #Parser #HTML #Npm #WebDev #Frontend
P : yml -> nix & yml -> python
T : yml -> python
#parser
Parcom: CL Parser Combinators
https://github.com/fosskers/parcom
#HackerNews #Parcom #CL #Parser #Combinators #HackerNews #Programming #Languages #GitHub
I finally got around to wrapping up and publishing a first version of my #Rust crate ts-typed-ast. It's a crate inspired by Rowan that automatically generates a typed AST from a tree-sitter grammar. You can find it here: https://crates.io/crates/ts-typed-ast
It works similarly to Rowan and Swift's libsyntax. tree-sitter provides the green nodes, while this crate generates the red nodes.
I've used it a few times already, to prototype various toy programming languages. You write a grammar in tree-sitter, and then either evaluate the ts-typed-ast tree directly, or convert it to some other IR.
Using tree-sitter as the parser generator for a toy project is pretty nice. You get a powerful, declarative way to create a parser, and at the same time you benefit from the whole tree-sitter ecosystem. Things like incremental parsing, syntax highlighting, structural editing, and formatting with Topiary.
Main downside is that tree-sitter does not (yet) offer good error reporting and recovery, so when parsing fails it's often in dramatic, unhelpful ways. Not a big issue for experimenting, which is what this crate is for. Production-ready languages probably need bespoke parsers anyway.
A high-throughput parser for the Zig programming language
https://github.com/Validark/Accelerated-Zig-Parser
#HackerNews #highthroughput #parser #Zig #programminglanguage #GitHub #Validark
Good introduction from https://entropicthoughts.com/parser-combinators-beat-regexes:
> They were surprised, however, that there seems to be a lack of community cohesion around regex libraries in Haskell.
> We generally don’t use regexes in Haskell. We use parser combinators instead, because they are almost always better. In other languages, it would be considered overkill to write a full parser when a simple regex can do the same thing. In Haskell, writing a parser is no big deal.
argp: GNU-style command line argument parser for Go
https://github.com/tdewolff/argp
#HackerNews #argp #GNU #Go #parser #commandline #programming
Red Green Syntax Trees - an Overview | by Will Speak (aka Plingdollar):
https://willspeak.me/2021/11/24/red-green-syntax-trees-an-overview.html
Here my quick build of a bash toml parser based on kwmiebach's (https://github.com/kwmiebach) version on github. Thanks kwmiebach!
https://codeberg.org/oxo/tool/src/branch/main/toml-read
The order of arguments (file, section key) is irrelevant. Data is aggregated if no key or section is given.
My idea is to integrate it with my paasword manager passr. Then my password files can be toml format.
Have a nice weekend!
Парсинг с помощью LLM: зачем, как и сколько стоит?
Во всю идет 2025 год, и нейросети перестают быть чем‑то фантастическим. Они уже повсюду в нашей жизни: от умных колонок в квартирах до сложнейших систем, управляющих логистикой и финансами. Вместе с ними стремительно меняется подход к работе с данными. В этой статье мы поговорим о том, как современные LLM помогают автоматизировать сбор данных с веб‑сайтов и сводят к минимуму рутинную настройку и «подкручивание» парсеров. Что еще вы найдете в этой статье?
who doesn't love a good #parser #differential #vuln in the morning? https://github.blog/security/sign-in-as-anyone-bypassing-saml-sso-authentication-with-parser-differentials/
To the #Rust #rustlang community: I once started to write a #compiler / #parser with #nom #crate. However I had some struggles with it of how to provide **multiple** errors with line+column indicators for a parsed context.
Now I read a tiny bit about #syn and #chumsky 👀
Are they the right crates for me? Are there others?
I do not parse rust-code, but a completely custom language (similar to pugjs)
(Boost for reach 🙏)
Saviez-vous qu'en JavaScript `parseInt('2️⃣`)` retourne 2 ?
Il y a une raison logique à cela.
C'est une combinaison de la composition de cet emoji et du fonctionnement de `parseInt` et cet article l'explique très bien.
🔗 https://www.aleksandrhovhannisyan.com/blog/parseint-keycap-emoji/
