From 39c61cd1064efc870dc2b79dc1fbb40f4a3fa879 Mon Sep 17 00:00:00 2001
From: Adrian Kummerländer
Date: Sun, 20 Oct 2013 17:59:20 +0200
Subject: Modified README to match recently added features

---
 README.md | 7 ++++---
 1 file changed, 4 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index a2745af..d6f8b2c 100644
--- a/README.md
+++ b/README.md
@@ -3,15 +3,16 @@
 ... is a simple parser for resolving mathematical terms. 
 
 The term is parsed by generating a binary expression tree using the [Shunting-Yard](http://en.wikipedia.org/wiki/Shunting-yard_algorithm) algorithm.
-The implementation itself does not use any external libraries and relies fully on the features provided by the C++ language and the STL.
+The implementation itself does not use any external libraries and relies fully on the features provided by the C++ language and the standard library.
 
 ## Current features:
 
 - Calculating terms with basic operators while respecting the priority of each operator
-- Support for brackets
+- Support for parentheses
+- Support for alphabetic constants
 - Export of the expression tree as [Graphviz](http://www.graphviz.org/) dot for visualization
 
 ## Requirements:
 
-- C++ compiler with support for new C++11 and STL features such as the auto keyword and unique_ptr (tested with GCC 4.7.2 on Linux)
+- C++ compiler with support for new C++11 language and standard library features such as the `auto` keyword and `unique_ptr` (tested with GCC 4.7.2 on Linux)
 - [GoogleTest](http://code.google.com/p/googletest/) for tests
-- 
cgit v1.2.3