Previously I introduced the concept on the LL(1) grammar and explained how a parser would go about parsing an input. In this post I want to design a grammar that is capable of parsing mathematical expressions. Before we actually get…
Read more
In the previous post in this series we wrote a tokenizer which splits the input into short segments called tokens. Each type of token is given a unique code and the input is reduced to a series of token codes….
Read more
In this short series I am talking about how to write a parser that analyses mathematical expressions and turns them into an object tree that is able to evaluate that expression. The first step in writing a parser is to…
Read more
The  LastFixingQuote is an implementation of the abstract Quote class. LastFixingQuote represents a quote for the last available fixing of an index. Essentially it is a simple wrapper around the Index class to allow indices to be used as Quotes. class…
Read more