Mastodon

PostgreSQLPostgreSQL beyond 18: The next decade of intelligent, reliable data infrastructure It’s rare to witness a technology stay relevant for 35 years without losing its edge. PostgreSQL has not just su... <a rel="nofollow noopener" class="mention hashtag" href="https://mastodon.social/tags/PostgreSQL" target="_blank">#PostgreSQL</a> <a rel="nofollow noopener" class="mention hashtag" href="https://mastodon.social/tags/PostgreSQL" target="_blank">#PostgreSQL</a> <a rel="nofollow noopener" class="mention hashtag" href="https://mastodon.social/tags/AI" target="_blank">#AI</a> <a rel="nofollow noopener" class="mention hashtag" href="https://mastodon.social/tags/Query" target="_blank">#Query</a> <a rel="nofollow noopener" class="mention hashtag" href="https://mastodon.social/tags/parser" target="_blank">#parser</a> <a rel="nofollow noopener" class="mention hashtag" href="https://mastodon.social/tags/SQL/JSON" target="_blank">#SQL/JSON</a> <a rel="nofollow noopener" class="mention hashtag" href="https://mastodon.social/tags/Database" target="_blank">#Database</a> <a rel="nofollow noopener" class="mention hashtag" href="https://mastodon.social/tags/development" target="_blank">#development</a> <a href="https://www.postgresql.fastware.com/blog/postgresql-beyond-18-the-next-decade-of-intelligent-reliable-data-infrastructure" rel="nofollow noopener" target="_blank">Origin</a> | <a href="https://awakari.com/sub-details.html?id=PostgreSQL" rel="nofollow noopener" target="_blank">Interest</a> | <a href="https://awakari.com/pub-msg.html?id=FWnEELitCtPZwSwIhBACaKPPeCm&interestId=PostgreSQL" rel="nofollow noopener" target="_blank">Match</a>

रञ्जित (Ranjit Mathew)Nice:“Which Parsing Approach?” [2020], Laurence Tratt (<a href="https://tratt.net/laurie/blog/2020/which_parsing_approach.html" rel="nofollow noopener" translate="no" target="_blank">https://tratt.net/laurie/blog/2020/which_parsing_approach.html</a>).On HN: <a href="https://news.ycombinator.com/item?id=35800189" rel="nofollow noopener" translate="no" target="_blank">https://news.ycombinator.com/item?id=35800189</a>On Lobsters: <a href="https://lobste.rs/s/9pcqys/which_parsing_approach" rel="nofollow noopener" translate="no" target="_blank">https://lobste.rs/s/9pcqys/which_parsing_approach</a><a href="https://mastodon.social/tags/Parsing" class="mention hashtag" rel="nofollow noopener" target="_blank">#Parsing</a> <a href="https://mastodon.social/tags/Programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#Programming</a> <a href="https://mastodon.social/tags/Compilers" class="mention hashtag" rel="nofollow noopener" target="_blank">#Compilers</a> <a href="https://mastodon.social/tags/Interpreters" class="mention hashtag" rel="nofollow noopener" target="_blank">#Interpreters</a> <a href="https://mastodon.social/tags/Parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#Parser</a> <a href="https://mastodon.social/tags/PLDI" class="mention hashtag" rel="nofollow noopener" target="_blank">#PLDI</a>

Andrey DarkCat09Всё же пришлось поизучать юникод.Два четырёхзначных кодпоинта могут идти в суррогатной паре UTF-16, тогда декодировать их можно только вместе (там какой-то алгоритм с битовыми операциями). То есть мне нужно обрабатывать такую ситуацию, когда в буфер попал первый кодпоинт из пары, без второго, и слать декодеру часть буфера до начала этой сломанной пары. Иначе декодер выдаст не то. Склеивать полученные байты не поможет.Пример: <code>\u1F4AF</code> — это эмоджи [💯] В жсоне для кодирования юникода применяется UTF-16-BE, видимо чтобы количество цифр в кодпоинте всегда было 4 для удобства парсинга (удобства!! спасибо, блин). Получаем <code>"\ud83d\udcaf"</code>. <code>\ud83d</code> — первый символ в суррогатной паре, leading UTF-16 surrogate, его можно определить по диапазону от <code>0xD800</code> до <code>0xDBFF</code> включительно. <code>\udcaf</code> — второй символ в паре, trailing UTF-16 surrogate, диапазон от <code>0xDC00</code> до <code>0xDFFF</code> включительно.Если парсер смог прочитать только первый кодпоинт 0xD83D и дошёл до конца буфера, значит, trailing surrogate мы не считали, декодировать кодпоинт не получится. Вернём его обратно к вызывающему (см. переменную <code>leftovers</code>), чтобы он добавил кривой жсон-эскейп с этим кодпоинтом в буфер в следующий раз, когда будет читать байты дальше. А щас декодируем только часть строки до <code>\ud83d</code>, не захватывая этот эскейп.Багфикс: <a href="https://git.dc09.ru/DarkCat09/proxishot/commit/e4873223f5" rel="nofollow noopener" target="_blank">https://git.dc09.ru/DarkCat09/proxishot/commit/e4873223f5</a>Разговор с самим собой: <a href="https://git.dc09.ru/DarkCat09/proxishot/issues/1" rel="nofollow noopener" target="_blank">https://git.dc09.ru/DarkCat09/proxishot/issues/1</a><a href="https://gts.dc09.ru/tags/unicode" class="mention hashtag" rel="nofollow noopener" target="_blank">#unicode</a> <a href="https://gts.dc09.ru/tags/utf16" class="mention hashtag" rel="nofollow noopener" target="_blank">#utf16</a> <a href="https://gts.dc09.ru/tags/json" class="mention hashtag" rel="nofollow noopener" target="_blank">#json</a> <a href="https://gts.dc09.ru/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a>

jnpn<a href="https://tratt.net/laurie/blog/2020/automatic_syntax_error_recovery.html" rel="nofollow noopener" translate="no" target="_blank">https://tratt.net/laurie/blog/2020/automatic_syntax_error_recovery.html</a><a href="https://mastodon.social/tags/grammar" class="mention hashtag" rel="nofollow noopener" target="_blank">#grammar</a> <a href="https://mastodon.social/tags/cfg" class="mention hashtag" rel="nofollow noopener" target="_blank">#cfg</a> <a href="https://mastodon.social/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a> <a href="https://mastodon.social/tags/error" class="mention hashtag" rel="nofollow noopener" target="_blank">#error</a>

codepilot🚀 <a href="https://chaos.social/tags/Tokay" class="mention hashtag" rel="nofollow noopener" target="_blank">#Tokay</a> v0.6.12 is out!A lot going on behind the scenes on <a href="https://chaos.social/tags/tokaylang" class="mention hashtag" rel="nofollow noopener" target="_blank">#tokaylang</a>: • <a href="https://chaos.social/tags/serde" class="mention hashtag" rel="nofollow noopener" target="_blank">#serde</a> support → load precompiled CBOR-VMs, yielding in a faster-loading per-thread <a href="https://chaos.social/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a> • <a href="https://chaos.social/tags/WASM" class="mention hashtag" rel="nofollow noopener" target="_blank">#WASM</a> support → Tokay now runs on Node <a href="https://chaos.social/tags/npm" class="mention hashtag" rel="nofollow noopener" target="_blank">#npm</a> • Tokay Playground, an in-browser IDE, is in the works!Try it & help shape what’s next 💡 🔗 <a href="https://crates.io/crates/tokay" rel="nofollow noopener" translate="no" target="_blank">https://crates.io/crates/tokay</a> 🔗 <a href="https://www.npmjs.com/package/tokay" rel="nofollow noopener" translate="no" target="_blank">https://www.npmjs.com/package/tokay</a><a href="https://chaos.social/tags/rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#rust</a> <a href="https://chaos.social/tags/compilers" class="mention hashtag" rel="nofollow noopener" target="_blank">#compilers</a>

Abhinav 🌏I'm starting a series of blog posts, in which I write a <a href="https://fantastic.earth/tags/bytecode" class="mention hashtag" rel="nofollow noopener" target="_blank">#bytecode</a> <a href="https://fantastic.earth/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a> and a <a href="https://fantastic.earth/tags/virtualMachine" class="mention hashtag" rel="nofollow noopener" target="_blank">#virtualMachine</a> for arithmetic in <a href="https://fantastic.earth/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#Haskell</a>. We explore the following topics in the series:- Parsing arithmetic expressions to ASTs. - Compiling ASTs to bytecode. - Interpreting ASTs. - Efficiently executing bytecode in a VM. - Disassembling bytecode and decompiling opcodes for debugging and testing. - Unit testing and property-based testing for our compiler and VM. - Benchmarking our code to see how the different passes perform. - All the while keeping an eye on performance.The first post of the series that focuses on writing the <a href="https://fantastic.earth/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a> is now out: <a href="https://abhinavsarkar.net/posts/arithmetic-bytecode-vm-parser/" rel="nofollow noopener" translate="no" target="_blank">https://abhinavsarkar.net/posts/arithmetic-bytecode-vm-parser/</a><a href="https://fantastic.earth/tags/programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#programming</a> <a href="https://fantastic.earth/tags/Blogging" class="mention hashtag" rel="nofollow noopener" target="_blank">#Blogging</a> <a href="https://fantastic.earth/tags/compilers" class="mention hashtag" rel="nofollow noopener" target="_blank">#compilers</a> <a href="https://fantastic.earth/tags/programmingLanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#programmingLanguages</a>

IFCompToday is the last day to register an intent to submit! Until Midnight Eastern Time!See you on: <a href="https://ifcomp.org/" rel="nofollow noopener" translate="no" target="_blank">https://ifcomp.org/</a> !!<a href="https://mastodon.gamedev.place/tags/ifcomp" class="mention hashtag" rel="nofollow noopener" target="_blank">#ifcomp</a> <a href="https://mastodon.gamedev.place/tags/interactivefictioncompetition" class="mention hashtag" rel="nofollow noopener" target="_blank">#interactivefictioncompetition</a> <a href="https://mastodon.gamedev.place/tags/ifcomp2025" class="mention hashtag" rel="nofollow noopener" target="_blank">#ifcomp2025</a> <a href="https://mastodon.gamedev.place/tags/interactivefiction" class="mention hashtag" rel="nofollow noopener" target="_blank">#interactivefiction</a> <a href="https://mastodon.gamedev.place/tags/visualnovel" class="mention hashtag" rel="nofollow noopener" target="_blank">#visualnovel</a> <a href="https://mastodon.gamedev.place/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a> <a href="https://mastodon.gamedev.place/tags/indiedev" class="mention hashtag" rel="nofollow noopener" target="_blank">#indiedev</a>

MrClon<a href="https://mitra.do.rayslava.com/users/rayslava" class="u-url mention" rel="nofollow noopener" target="_blank">@rayslava</a> так почему тогда обвязка в виде лямбды спасает отца русской демократии?Вот полный пример ``` import argparse parser = argparse.ArgumentParser() <a href="https://mastodon.ml/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a>.add_argument("--foo", type=re.compile) parser.add_argument("--foo", type=lambda s: re.compile(s)) args = parser.parse_args([ "--foo", ".*" ]) ``` На вход функции переданной как type передаётся ровно один аргумент, собственно строка '.*'

Jason WeatherlyOkay, added a few more features and I'm really liking the results. I added the `-` operator for `dice_groups` which was a bit more tricky than I thought it'd be. I also added the ability to roll a dice group multiple times via a `x`|`*` operator. I removed the requirement that a dice group has to have a damage type associated with it since the only way you can roll something like `1d4-1` is in a dice group since there is a minimum value of 1 associated with it.The code lives here: <a href="https://codeberg.org/JamesTheBard/dice-roller" rel="nofollow noopener" translate="no" target="_blank">https://codeberg.org/JamesTheBard/dice-roller</a><a href="https://social.linux.pizza/tags/python" class="mention hashtag" rel="nofollow noopener" target="_blank">#python</a> <a href="https://social.linux.pizza/tags/lark" class="mention hashtag" rel="nofollow noopener" target="_blank">#lark</a> <a href="https://social.linux.pizza/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a> <a href="https://social.linux.pizza/tags/ttrpg" class="mention hashtag" rel="nofollow noopener" target="_blank">#ttrpg</a> <a href="https://social.linux.pizza/tags/diceroller" class="mention hashtag" rel="nofollow noopener" target="_blank">#diceroller</a> <a href="https://social.linux.pizza/tags/programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#programming</a>

Jason WeatherlyOkay, _now_ I'm done. Fixed a few parser errors and implemented a skew option (the `^` value) that will push the average value towards either 1 or the maximum of the dice. I like that once you get the parser up and running that it's easy to add stuff to it. I now am the official owner of a completely overkill dice running program.For the example below, the skew is `2.0`. The random value is raised to the `1/skew` power before being multiplied by the number of sides of the die. If skew goes up, so do the results. If skew goes down, well, so do the results.``` $ python main.py "^2 (2d6+2d8+12)[fire]+1d8[piercing]" | jq . { "results": { "fire": 37, "piercing": 7 } } ```<a href="https://social.linux.pizza/tags/python" class="mention hashtag" rel="nofollow noopener" target="_blank">#python</a> <a href="https://social.linux.pizza/tags/statistics" class="mention hashtag" rel="nofollow noopener" target="_blank">#statistics</a> <a href="https://social.linux.pizza/tags/ttrpgs" class="mention hashtag" rel="nofollow noopener" target="_blank">#ttrpgs</a> <a href="https://social.linux.pizza/tags/dice" class="mention hashtag" rel="nofollow noopener" target="_blank">#dice</a> <a href="https://social.linux.pizza/tags/lark" class="mention hashtag" rel="nofollow noopener" target="_blank">#lark</a> <a href="https://social.linux.pizza/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a>

claudeBefore starting the big work of porting my experimental <a href="https://post.lurk.org/tags/LiveCoding" class="mention hashtag" rel="nofollow noopener" target="_blank">#LiveCoding</a> <a href="https://post.lurk.org/tags/uzulang" class="mention hashtag" rel="nofollow noopener" target="_blank">#uzulang</a> <a href="https://post.lurk.org/tags/godwit" class="mention hashtag" rel="nofollow noopener" target="_blank">#godwit</a> 's <a href="https://post.lurk.org/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a> from <a href="https://post.lurk.org/tags/Alex" class="mention hashtag" rel="nofollow noopener" target="_blank">#Alex</a> and <a href="https://post.lurk.org/tags/Happy" class="mention hashtag" rel="nofollow noopener" target="_blank">#Happy</a> to <a href="https://post.lurk.org/tags/Parsec" class="mention hashtag" rel="nofollow noopener" target="_blank">#Parsec</a>, I finally managed to get a snapshot working in <a href="https://post.lurk.org/tags/Termux" class="mention hashtag" rel="nofollow noopener" target="_blank">#Termux</a> on my phone by making a tarball including the generated <a href="https://post.lurk.org/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#Haskell</a> files on a machine where Alex and Happy were available and transferring it over network.This isn't ideal as I can't edit the parser on my phone (no Alex/Happy there; at least not recent enough versions, old ones got via cjacker's Hugs 2019 improvement), so I still want to switch to Parsec which is not so horribly <a href="https://post.lurk.org/tags/GHC" class="mention hashtag" rel="nofollow noopener" target="_blank">#GHC</a> -only (Parsec has a version that works with <a href="https://post.lurk.org/tags/MicroHs" class="mention hashtag" rel="nofollow noopener" target="_blank">#MicroHs</a> and probably <a href="https://post.lurk.org/tags/Hugs" class="mention hashtag" rel="nofollow noopener" target="_blank">#Hugs</a> <a href="https://post.lurk.org/tags/HaskellHugs" class="mention hashtag" rel="nofollow noopener" target="_blank">#HaskellHugs</a> too).I put the snapshot at <a href="https://mathr.co.uk/web/godwit.html#Download" rel="nofollow noopener" translate="no" target="_blank">https://mathr.co.uk/web/godwit.html#Download</a> and meanwhile updated the bootstrap script as patching MicroHs isn't necessary any more.

Jan :rust: :ferris:mdq - by yshavit<a href="https://github.com/yshavit/mdq" rel="nofollow noopener" translate="no" target="_blank">https://github.com/yshavit/mdq</a>like <a href="https://floss.social/tags/jq" class="mention hashtag" rel="nofollow noopener" target="_blank">#jq</a> but for <a href="https://floss.social/tags/Markdown" class="mention hashtag" rel="nofollow noopener" target="_blank">#Markdown</a>: find specific elements in an md docAlso available as a crate: <a href="https://docs.rs/mdq/latest/mdq/" rel="nofollow noopener" translate="no" target="_blank">https://docs.rs/mdq/latest/mdq/</a>Tagging <a href="https://fosstodon.org/@wader" class="u-url mention" rel="nofollow noopener" target="_blank">@wader</a> 😉 <a href="https://floss.social/tags/CLI" class="mention hashtag" rel="nofollow noopener" target="_blank">#CLI</a> <a href="https://floss.social/tags/Parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#Parser</a> <a href="https://floss.social/tags/Rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#Rust</a> <a href="https://floss.social/tags/RustLang" class="mention hashtag" rel="nofollow noopener" target="_blank">#RustLang</a>

Henrik JernevadAny <a href="https://mastodon.social/tags/TOML" class="mention hashtag" rel="nofollow noopener" target="_blank">#TOML</a> nerds? Would you say this is valid TOML? (I'm building a parser.)``` inline = { array = [ 1, 2 ] } ```The spec says "No newlines are allowed between the curly braces unless they are valid within a value."This includes multi-line strings, but do you interpret it to permit newlines in an array? The array itself is technically a single value inside which newlines are valid. It is obviously not "in the spirit" of inline tables but the ABNF grammar allows it.<a href="https://mastodon.social/tags/programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#programming</a> <a href="https://mastodon.social/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a>

Hacker NewsOptimizing a Math Expression Parser in Rust<a href="https://rpallas.xyz/math-parser/" rel="nofollow noopener" translate="no" target="_blank">https://rpallas.xyz/math-parser/</a><a href="https://mastodon.social/tags/HackerNews" class="mention hashtag" rel="nofollow noopener" target="_blank">#HackerNews</a> <a href="https://mastodon.social/tags/Optimizing" class="mention hashtag" rel="nofollow noopener" target="_blank">#Optimizing</a> <a href="https://mastodon.social/tags/Math" class="mention hashtag" rel="nofollow noopener" target="_blank">#Math</a> <a href="https://mastodon.social/tags/Expression" class="mention hashtag" rel="nofollow noopener" target="_blank">#Expression</a> <a href="https://mastodon.social/tags/Parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#Parser</a> <a href="https://mastodon.social/tags/Rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#Rust</a> <a href="https://mastodon.social/tags/Programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#Programming</a> <a href="https://mastodon.social/tags/RustLang" class="mention hashtag" rel="nofollow noopener" target="_blank">#RustLang</a> <a href="https://mastodon.social/tags/Coding" class="mention hashtag" rel="nofollow noopener" target="_blank">#Coding</a> <a href="https://mastodon.social/tags/Efficiency" class="mention hashtag" rel="nofollow noopener" target="_blank">#Efficiency</a>

HabrQapGen: Создаём мощные парсеры на C++QapDSLv2 — это язык который транслируется в обычный C++ код. Он позволяет удобно и компактно задавать грамматики/правила разбора кода программ, значительно упрощая разработку компиляторов/анализаторов/трансляторов. QapGen — это генератор дерева_лексеров /парсеров описанных на QapDSLv2. Сама грамматика QapDSLv2 описана на QapDSLv2 на 100%. Поэтому QapGen как основной читатель этой грамматики сам генерирует часть своего кода(весь парсер QapDSLv2). Основные фишки QapDSLv2 + QapGen — это: 1) Отсутствие этапа токенизации — дерево лексеров разбивает входной поток на лексемы и сохраняет их в строго типизированных древовидных С++ структурах пропуская этап токенизации. 2) Генерация оптимизированного кода полиморфных лексеров . 3) Полное сохранение всех лексем(даже разделители сохраняются, такие как пробелы/переходы на новую строку и комментарии) в результирующем дереве. 4) Возможность сохранить как оригинальное дерево , так и модифицированное обратно в код/текст без потери разделителей/комментариев . 5) Автоматическая генерация кода посетителей (это такой паттерн проектирования). А теперь пример самой сочной части(рекурсивно самоописывающийся код): struct t_target_struct:i_target_item{ struct t_keyword{ string kw=any_str_from_vec(split("struct,class",",")); " "? // optional separator }; struct t_body_semicolon:i_struct_impl{";"}; struct t_body_impl:i_struct_impl{ "{" // жрём скобочку vector<TAutoPtr<i_target_item>> nested?; // рекурсия! " "? vector<TAutoPtr<i_struct_field>> arr?; // парсим поля " "? TAutoPtr<t_cpp_code> c?; // остальной С++ код " "? "}" }; struct t_parent{ string a_or_c=any_str_from_vec(split("=>,:",",")); " "? t_name name; }; //точка входа в парсер: TAutoPtr<t_keyword> kw?; //парсим struct/class t_name name; //парсим имя " "? TAutoPtr<t_parent> parent?; " "? TAutoPtr<i_struct_impl> body; };<a href="https://habr.com/ru/articles/925420/" rel="nofollow noopener" translate="no" target="_blank">https://habr.com/ru/articles/925420/</a><a href="https://zhub.link/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a> <a href="https://zhub.link/tags/parsergenerator" class="mention hashtag" rel="nofollow noopener" target="_blank">#parsergenerator</a> <a href="https://zhub.link/tags/lexers" class="mention hashtag" rel="nofollow noopener" target="_blank">#lexers</a> <a href="https://zhub.link/tags/c" class="mention hashtag" rel="nofollow noopener" target="_blank">#c</a>++ <a href="https://zhub.link/tags/tree" class="mention hashtag" rel="nofollow noopener" target="_blank">#tree</a> <a href="https://zhub.link/tags/ast" class="mention hashtag" rel="nofollow noopener" target="_blank">#ast</a> <a href="https://zhub.link/tags/gamedev" class="mention hashtag" rel="nofollow noopener" target="_blank">#gamedev</a> <a href="https://zhub.link/tags/dsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dsl</a> <a href="https://zhub.link/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a>

HabrКак создать свой парсер и AST-генератор на C++ с минимальными усилиями: знакомьтесь с QapDSLv2QapDSLv2: Новый стандарт AST-heavy парсинга QapDSLv2 обеспечивает: Молниеносное построение AST Полное сохранение структуры исходного кода Простоту интерпретации и модификации грамматик Забудьте о любы других парсерах! С помощью QapDSLv2 можно создавать компиляторы/анализаторы/форматировщики кода за минуты/часы. // почти наглая лож Парсеры и генерация абстрактных синтаксических деревьев ( AST ) — это обычно долго, сложно и требует тонны шаблонного кода. Но что если я скажу, что теперь можно описывать грамматики и структуры данных одновременно и получать готовый, оптимизированный C++ код автоматически? QapDSLv2 — новый стандарт эффективности и удобства в парсинге . Это язык описания парсеров, который избавляет от синтаксического шума, упрощает интеграцию с C++ и позволяет создавать сложные анализаторы без боли и ошибок . Забудьте о бесконечных циклах отладки и непонятных генераторах — теперь всё просто, понятно и эффективно. В этой статье вы узнаете, как QapDSL v2 меняет правила игры в мире парсинга и компиляторов, увидите реальные примеры и поймёте, почему это важно для каждого, кто работает с языками программирования и обработкой текста . Готовы ускорить разработку и вывести свои проекты на новый уровень? QapGen — мощный генератор парсеров, построенный на основе QapDSLv2, который из грамматик QapDSLv2 сразу создаёт высокопроизводительный C++ парсер с типизированным AST , описанным прямо в грамматике. t_sep { string body = any (" \t\r\n"); } using " " as t_sep; t_value{ TAutoPtr<i_value> body; " "? } t_comma_value{ "," t_value body; " "? } t_array=>i_value{ "[" " "? t_value first?; vector<t_comma_value> arr?; "]" " "? }<a href="https://habr.com/ru/articles/922128/" rel="nofollow noopener" translate="no" target="_blank">https://habr.com/ru/articles/922128/</a><a href="https://zhub.link/tags/QapDSL" class="mention hashtag" rel="nofollow noopener" target="_blank">#QapDSL</a> <a href="https://zhub.link/tags/Lexers" class="mention hashtag" rel="nofollow noopener" target="_blank">#Lexers</a> <a href="https://zhub.link/tags/AST" class="mention hashtag" rel="nofollow noopener" target="_blank">#AST</a> <a href="https://zhub.link/tags/Compilers" class="mention hashtag" rel="nofollow noopener" target="_blank">#Compilers</a> <a href="https://zhub.link/tags/Parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#Parser</a> <a href="https://zhub.link/tags/parsergenerator" class="mention hashtag" rel="nofollow noopener" target="_blank">#parsergenerator</a> <a href="https://zhub.link/tags/Parsers" class="mention hashtag" rel="nofollow noopener" target="_blank">#Parsers</a> <a href="https://zhub.link/tags/C" class="mention hashtag" rel="nofollow noopener" target="_blank">#C</a>++ <a href="https://zhub.link/tags/dsl" class="mention hashtag" rel="nofollow noopener" target="_blank">#dsl</a>

Dzokero<a href="https://pol.social/@siwa" class="u-url mention" rel="nofollow noopener" target="_blank">@siwa</a> Polska warcząca <a href="https://mastodon.social/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a> Sorki, ale mi się jakoś skojarzyło ;)

HabrСистема аналитики и презентации данных с учётом ограничений системы FСистема аналитики и презентации данных — мой проект, который я выполнял в рамках курсовых работ во время обучения в институте. Описал основные шаги, идеи и поделился своими успехами.<a href="https://habr.com/ru/articles/916854/" rel="nofollow noopener" translate="no" target="_blank">https://habr.com/ru/articles/916854/</a><a href="https://zhub.link/tags/%D0%B0%D0%BD%D0%B0%D0%BB%D0%B8%D1%82%D0%B8%D0%BA%D0%B0" class="mention hashtag" rel="nofollow noopener" target="_blank">#аналитика</a> <a href="https://zhub.link/tags/%D1%80%D0%B0%D0%B7%D1%80%D0%B0%D0%B1%D0%BE%D1%82%D0%BA%D0%B0" class="mention hashtag" rel="nofollow noopener" target="_blank">#разработка</a> <a href="https://zhub.link/tags/python" class="mention hashtag" rel="nofollow noopener" target="_blank">#python</a> <a href="https://zhub.link/tags/streamlit" class="mention hashtag" rel="nofollow noopener" target="_blank">#streamlit</a> <a href="https://zhub.link/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a>

Jan :rust: :ferris:In which I have Opinions about parsing and grammars - by Simon Tatham<a href="https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/parsing/" rel="nofollow noopener" translate="no" target="_blank">https://www.chiark.greenend.org.uk/~sgtatham/quasiblog/parsing/</a><a href="https://floss.social/tags/ProgrammingLanguage" class="mention hashtag" rel="nofollow noopener" target="_blank">#ProgrammingLanguage</a> <a href="https://floss.social/tags/PLT" class="mention hashtag" rel="nofollow noopener" target="_blank">#PLT</a> <a href="https://floss.social/tags/Parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#Parser</a> <a href="https://floss.social/tags/Parsing" class="mention hashtag" rel="nofollow noopener" target="_blank">#Parsing</a> <a href="https://floss.social/tags/Grammar" class="mention hashtag" rel="nofollow noopener" target="_blank">#Grammar</a>

Abhinav 🌏The tiny but complete <a href="https://fantastic.earth/tags/JSON" class="mention hashtag" rel="nofollow noopener" target="_blank">#JSON</a> <a href="https://fantastic.earth/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#parser</a> that I wrote in <a href="https://fantastic.earth/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#Haskell</a> years ago is now featured in the 200-and-change collection of programs by <a href="https://hachyderm.io/@dubroy" class="u-url mention" rel="nofollow noopener" target="_blank">@dubroy</a>: <a href="https://pdubroy.github.io/200andchange" rel="nofollow noopener" translate="no" target="_blank">https://pdubroy.github.io/200andchange</a><a href="https://fantastic.earth/tags/programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#programming</a>

Recent searches

Search options

Administered by:

Server stats:

#parser