Building a RegExp machine. Part 1: Regular grammars
In this series of articles we’re going to study a theory and implementation behind the formalism of regular expressions, — the technique used for text processing, implementation of tokenizers, etc. Audience: experienced programmers, professionals. You can also see more details, and enroll to full course. Note: this is not a series on “how to use regexp”, but rather on “how to implement regexp”. Yo
Syntax: language agnostic parser generator
In this post we’ll briefly talk about the new language agnostic parser generator, called Syntax. Note: we don’t describe here parsers algorithms in detail; the target audience is supposed to be familiar with parsers terminology, and basic parsing techniques. For detailed info on parsers theory and implementation you can address the Essentials of Parsing course. Syntax tool is implemented as a Node
OO Relationships
In this small note we recap concepts of objects relationships in Object-Oriented programming. Recently Allen Wirfs-Brock raised an interesting topic for distinguishing and abstracting a concept of “an open set of objects that share a common interface and implementation”. A first possible definition that comes in mind can be a “type”, or a “class”. However, objects relationships in object-oriented
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
