Dmitry SoshnikovSpecifics of C++ lambdasLambda functions, introduced since C++11, are convenient way of passing different types of callbacks, doing parametrized operations, etc.6 min read·Oct 10, 2019--1--1
Dmitry SoshnikovBuilding a RegExp machine. Part 2: Finite automata — NFA fragmentsThis is a second chapter of the “Building a RegExp machine” series, where we discuss a theory and implementation behind the regular…10 min read·Nov 5, 2017--4--4
Dmitry SoshnikovBuilding a RegExp machine. Part 1: Regular grammarsIn this series of articles we’re going to study a theory and implementation behind the formalism of regular expressions, — the technique…6 min read·Oct 30, 2017--1--1
Dmitry SoshnikovincodeburstJS scope: static, dynamic, and runtime-augmentedThe purpose of this note is to have a distinct, and exact terminology for different types of scopes used in JS, and in programming…4 min read·Jun 21, 2017--6--6
Dmitry SoshnikovRust LALR(1) parser generatorIn this small note we’ll talk about new plugin for the Syntax tool, which allows building parsers for Rust programming language.3 min read·Jun 15, 2017----
Dmitry SoshnikovUsing modern regexes in JavaScriptIt’s not a secret, that today JS RegExp library is pretty limited in contrast with Python regexes, or PCRE. A good thing though, ES2018 is…3 min read·Apr 24, 2017----
Dmitry SoshnikovRegExp Tree: a regular expressions processorTL;DR: RegExp Tree is a regular expressions processor, which includes parser, traversal, transformer, optimizer, and compat-compiler APIs.4 min read·Mar 21, 2017----
Dmitry SoshnikovSyntax: language agnostic parser generatorIn this post we’ll briefly talk about the new language agnostic parser generator, called Syntax.6 min read·Oct 18, 2016--1--1
Dmitry SoshnikovOO RelationshipsIn this small note we recap concepts of objects relationships in Object-Oriented programming.8 min read·Jan 19, 2016--2--2