This is why you should never use parser combinators and PEG
Let me tell you why you should (nearly) never use PEG (parsing expression grammars). Nearly everything I will say applies to parser combinators (parsec in Haskell, nom in Rust), too. So, don't use PEG. Use CFGs (context-free grammars) instead. They are more natural. I feel that CFGs more naturally represent how we think. Thus when you have some language in your head and you try to write it down as
Regular, Recursive, Restricted
Regular, Recursive, Restricted Jun 4, 2024 A post/question about formal grammars, wherein I search for a good formalism for describing infix expressions. Problem statement: it’s hard to describe arithmetic expressions in a way that: declaratively captures the overall shape of expression, and has a clear precedence semantics Let’s start with the following grammar for arithmetic expressions: Expr =
Lisp Game Jam - "Wireworld" - Hoot's low level WASM tooling in action -- Spritely Institute
This blogpost focuses on our second Spring Lisp Game Jam 2023 entry, wasm4-wireworld, an implementation of Wireworld on top of Hoot's lower-level assembly tools which are a part of our Guile → WASM project to bring Spritely Goblins-powered distributed applications to the common web browser. For our entry, we targeted WASM-4, a "fantasy console" which uses low-level WebAssembly constructs. In fact,
ワイヤワールド - Wikipedia
2つのダイオードをワイヤワールドで構成した例。上が順方向、下が逆方向に電圧がかかった状態に相当する。 ワイヤワールド（Wireworld）は、Brian Silverman が 1987年に発表したセル・オートマトンの一種。当初、Phantom Fish Tank というプログラムの一部として使用されていただけだったが、Scientific American誌（日本では日経サイエンス）の "Computer Recreations" というコラムで紹介され、広く知られるようになった。ワイヤワールドは電子論理回路のシミュレーションに適しており、規則が非常に単純であることから、ワイヤワールド内で完全なコンピュータを構築することも可能である。 規則[編集] ワイヤワールドのセルは以下の4種類の状態のいずれかである: 空（黒） 導体（黄色） 電子の頭（青） 電子の尾（赤） 3ステップを世代と呼ぶ。
Cirkoban: Sokoban meets cellular automata written in Scheme -- Spritely Institute
Last week, we released a small puzzle game called Cirkoban. Cirkoban is the very first publicly accessible application developed by Spritely that features the Goblins distributed programming library running in web browsers. We bet big on Hoot, our Scheme-to-WebAssembly compiler, a little over a year ago in order to bring Goblins to the web. That bet is starting to pay off! In this post, we’ll talk
Lisp: Icing or Cake? — dthompson
The Spring Lisp Game Jam 2024 ended one week ago. 48 games were submitted, a new record for the jam! This past week has been a time for participants to play and rate each other’s games. As I explored the entries, I noticed two distinct meta-patterns in how people approached building games with Lisp. I think these patterns apply more broadly to all applications of Lisp. Let’s talk about these patte
Parsing JSON is a Minefield
seriot.ch About > Projects > Parsing JSON is a Minefield Parsing JSON is a Minefield 💣 [2016-10-26] First version of the article [2016-10-28] Presentation at Soft-Shake Conference, Geneva (slides) [2016-11-01] Article and comments in The Register [2017-11-16] Presentation at Black Alps Security Conference, Yverdon (slides) [2018-03-09] Presentation at Toulouse Hacking Conference (slides) [2018-03
Three.js Shading Language
Creating shaders has always been an advanced step for most developers, many game developers have never created GLSL code from scratch. The shader graph solution adopted today by the industry has allowed developers more focused on dynamics to create the necessary graphic effects to meet the demands of their projects. The aim of the project is to create an easy-to-use, environment for shader creatio
0.1 + 0.2
The first time I saw 0.30000000000000004 as the answer to 0.1 + 0.2, I was unpleasantly surprised. Once I got used to seeing it from so many languages, the surprise wore off; now I'm pleasantly surprised if I see 0.3 instead! So why doesn't every language answer 0.3? Why is the most common answer 0.30000000000000004, and what are the pros and cons of having the answer be 0.3 instead? The tradeoffs
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
This is why you should never use parser combinators and PEG | Lobsters
Regular, Recursive, Restricted | Lobsters
What’s your preferred tech stack when building side projects? | Lobsters
Cirkoban: Sokoban meets cellular automata written in Scheme | Hacker News
Lisp: Icing or Cake? | Lobsters
GitHub - traefik/yaegi: Yaegi is Another Elegant Go Interpreter
Parsing JSON Is a Minefield (2018) | Hacker News
Three.js Shading Language | Hacker News
Val Town
Running Go on Val Town
Running Go on Val Town | Lobsters