サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
ノーベル賞
www.piumarta.com
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
LYSP — 50 Years of Symbolic Processing Last weekend I was thinking about Ashwin Ram's Short Ballad Dedicated to the Growth of Programs and the result is LYSP: a tiny, lightweight Lisp interpreter closely following the tradition of the earliest implementations. It is dedicated to the inventor and early implementations of that language, which is 50 years old this year. If you partially evaluate LYSP
cola — combined lambda/object architecture cola (aka Idst, Jolt, the SODA languages, &c.) is an ongoing project to create a springboard for investigating new computing paradigms. Everything in it is late-bound, the intention being that any paradigm (existing or yet to be invented, formal complexity notwithstanding) be easily and efficiently mapped to it and made available to the user. It is a smal
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
このページを最初にブックマークしてみませんか?
『www.piumarta.com』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く