PEG(1)
PEG(1) PEG(1) NAME peg, leg - parser generators SYNOPSIS peg [-hvV -ooutput] [filename ...] leg [-hvV -ooutput] [filename ...] DESCRIPTION peg and leg are tools for generating recursive-descent parsers: pro- grams that perform pattern matching on text. They process a Parsing Expression Grammar (PEG) [Ford 2004] to produce a program that recog- nises legal sentences of that grammar. peg processes P
peg/leg
peg/leg — recursive-descent parser generators for C peg and leg are tools for generating recursive-descent parsers: programs that perform pattern matching on text. They processes a Parsing Expression Grammar (PEG) [Ford 2004] to produce a program that recognises legal sentences of that grammar. peg processes PEGs written using the original syntax described by Ford; leg processes PEGs written using
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
GitHub - J-F-Liu/pom: PEG parser combinators using operator overloading without macros.
GitHub - kevinmehall/rust-peg: Parsing Expression Grammar (PEG) parser generator for Rust
GitHub - mna/pigeon: Command pigeon generates parsers in Go from a PEG grammar.
{{#tags}}- {{label}}
{{/tags}}