In a previous post I discussed the abstract class TermStructure that defines methods common to any kind of term structure. It was pointed out that many classes inherit from the TermStructure class, including a class called YieldTermStructure. This class is, again,…
Read more
In the section on numeric types in QuantLib, the Rate type was introduced which was intended to hold any kind of rates, including interest rates. The Rate type is essentially a double or a float number, depending on the configuration at…
Read more
During the course of this series we have written a tokenizer, designed a grammar, implemented the grammar in a recursive descent parser and built an expression tree that corresponds to the mathematical expression and that is able to calculate a…
Read more
In the last post I created classes that can represent a mathematical expression in the form of a tree data structure. We saw how expressions could be stored and evaluated but the code was not linked to the parser yet….
Read more
The last post in this series showed you how a mathematical expression parser was implemented from the grammar that we designed earlier. This was all fine and good but the parser did not do much except confirm if a mathematical…
Read more
In the last post about the Java expression parser we designed a grammar for analysing a mathematical expression. That was certainly all a bit abstract and theoretical for many readers. Now we are ready to put some meat on these…
Read more
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
Plugin by Social Author Bio