From eb28fe84b4a139d5937eb1b9e96cd6220a59eb58 Mon Sep 17 00:00:00 2001
From: Adrian Kummerlaender
Date: Tue, 12 Aug 2014 16:45:23 +0200
Subject: Somewhat fleshed out the project pages * e.g. linked Github and cgit
 repositories

---
 source/00_content/pages/projects/simple_parser.md | 13 +++++++++++++
 1 file changed, 13 insertions(+)

(limited to 'source/00_content/pages/projects/simple_parser.md')

diff --git a/source/00_content/pages/projects/simple_parser.md b/source/00_content/pages/projects/simple_parser.md
index e6b8f25..4ceb226 100644
--- a/source/00_content/pages/projects/simple_parser.md
+++ b/source/00_content/pages/projects/simple_parser.md
@@ -3,3 +3,16 @@
 …is a simple parser for resolving mathematical terms.
 
 The term is parsed by generating a binary expression tree using the Shunting-Yard algorithm. The implementation itself does not use any external libraries and relies fully on the features provided by the C++ language and the standard library.
+
+This application marks the first steps in C++ I took a couple of years back and is available on [Github] or [cgit].
+
+### Current features
+
+* Calculating terms with basic operators while respecting the priority of each operator
+* Support for parentheses
+* Support for alphabetic constants
+* Export of the expression tree as [Graphviz] dot for visualization
+
+[Graphviz]: http://www.graphviz.org/
+[Github]: https://github.com/KnairdA/SimpleParser
+[cgit]: http://code.kummerlaender.eu/SimpleParser/
-- 
cgit v1.2.3