PEG parsing series
My series of blog posts about PEG parsing keeps expanding. Instead of updating each part to link to all other parts, here’s the table of content: PEG ParsersBuilding a PEG ParserGenerating a PEG ParserVisualizing PEG ParsingLeft-recursive PEG GrammarsAdding Actions to a PEG GrammarA Meta-Grammar for PEG ParsersImplementing PEG FeaturesPEG at the Core Developer SprintA video of a talk I gave about
Minipeg - Parser generator for C
Minipeg is a parser generator for C that you can easily add to your project as a single file. Single file distribution minipeg.c Example calculator Example x86_64 assembler Source code Man Page MINIPEG(1) General Commands Manual MINIPEG(1) NAME minipeg - parser generator SYNOPSIS minipeg [-hvVP -ooutput] [filename ...] DESCRIPTION minipeg is a tool for generating recursive-descent parsers: program
"Writing a PEG parser for fun and profit" - Guido van Rossum (North Bay Python 2019)
Parsing Expression Grammars (PEGs) are a relatively new formalism for describing grammars suitable for automatically generating efficient parsers. I've become interested in using a PEG-generated parser as an alternative to CPython's nearly 30 year old "pgen" parser generator. This poses some interesting problems. I've also come up with a neat way of visualizing the parsing process, which is helpfu
About the Rosie Project
Mission Statement The Rosie Pattern Language (RPL) is intended to replace regular expressions (regex) in situations where: many regex are used in an application, project, or organization; or some regex are used by many people, or by a few people over a long period of time; or regex are used in production systems, where the cost of run-time errors is high. The advantages conferred by RPL in cases 1
PEG Parsers
Some years ago someone asked whether it would make sense to switch Python to a PEG parser. (Or a PEG grammar; I don’t recall exactly what was said by whom, or when.) I looked into it a bit and wasn’t sure what to think, so I dropped the subject. Recently I’ve learned more about PEG (Parsing Expression Grammars), and I now think it’s an interesting alternative to the home-grown parser generator tha
pest. The Elegant Parser
pest is a general purpose parser written in Rust with a focus on accessibility, correctness, and performance. It uses parsing expression grammars (or PEG) as input, which are similar in spirit to regular expressions, but which offer the enhanced expressivity needed to parse complex languages. Accessibility Grammar-generated parsers are both easier to use and maintain than their hand-written counte
Google グループ
Google グループでは、オンライン フォーラムやメール ベースのグループを作成したり、こうしたフォーラムやグループに参加したりすることで、大勢のユーザーと情報の共有やディスカッションを行うことができます。
pom/doc/article.md at master · J-F-Liu/pom
After I've learned C/C++ and C#, I found that choosing a new programming language can greatly affect a programmer's productivity. On one hand I keep sorting out new languages, there are hundreds of them, I examine and choose what I like best, my favorites are C#, Ruby, TypeScript and Rust. On the other hand I try to design a new language and implement a compiler by myself. I like the syntax provid
文脈自由文法(CFG)と解析表現文法(PEG)をHaskellのモナドで説明する話 - 簡潔なQ
文脈自由文法(Context Free Grammar) と 解析表現文法(Parsing Expression Grammar) は記法が似ているものの、その性質は大きく異なっている。しかし、以下のようにHaskellのモナドを用いて、左再帰的でない文脈自由文法をそのままパーサーコンビネーターとして変換すると、PEGはList monadをMaybe monadとして置き換えたものとして説明できる。 -- CFGとPEGの関係を List vs. Maybe として説明するサンプル import Control.Monad import Control.Monad.State -- 型の説明 : StateT String m a -- StateT String ... 構文解析の残りの文字列を記憶している。 -- m ... 正否をあらわす。ListにするとCFG, Maybeにする
PEGと構文解析に関するアレコレの勉強会 Vol.1 - 資料一覧 - connpass
「PEGと構文解析に関するアレコレの勉強会 Vol.1」の資料一覧です。
Packrat Parsing and Parsing Expression Grammars
Introduction Parsing expression grammars (PEGs) are an alternative to context free grammars for formally specifying syntax, and packrat parsers are parsers for PEGs that operate in guaranteed linear time through the use of memoization. For a brief technical summary see the Wikipedia entry on PEGs. For more in-depth descriptions see the original PEG paper and packrat parsing paper, and related pape
Handy Incremental Parser
Handy Incremental ParserProblem Most programming language compilers usually process source code files at once. Compilation time using this approach is proportional to the overall source code size in best case. In practice, the time may grow to seconds, and even minutes, as the code base grows. This approach is not suitable for writing language support plugins for code editors and IDEs for two reas
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
