In the last version of Visual Studio 2013, support for SQL Server compact (.SDF) has been dropped. What’s alternative for this? SQLite is a lightweight database engine which you can use in small projects without installation of complex database systems. […]

One requirement of a project for the logistics industry was printing barcode labels in a GS1-128 format. I have written a library which lets you encode the desired sequence in a GS1-128 format. The barcode is automatically saved to the graphic or to […]

Visualization of a simple algorithms of two-dimensional Turing machine can create impressive images. The “movement” of the head of Turing machine can be irregular in the early stage, but it start making characteristic patterns after millions of iterations. In this post I will show how to define a table of rules the Turing machine for a simple cellular automaton that is Langton’s ant and sample visualizations of the work of other machines.

In the first part of article I presented the parser for conversion a traditional algebraic expression to the RPN representation. In this part, I will show you, how to implement the algorithm for calculating the RPN expression and the architecture to extending abilities of the parser to support custom functions.

Mathematical expressions in the traditional algebraic notation can be calculated using an algorithm RPN (Reverse Polish Notation). In the first part of this article, I will show you how to implement a parser that converts the traditional algebraic form of mathematical expression to the RPN notation. In the second part of article, I will implement an algorithm for calculating the RPN expression and the architecture which allows for easy extend the the parser to support mathematical custom functions.