From fbc59064ef87e2a1a4be5d0b61b521c1f6374359 Mon Sep 17 00:00:00 2001
From: Niko Matsakis <niko@alum.mit.edu>
Date: Wed, 24 Jun 2015 06:03:57 -0700
Subject: [PATCH] Update README

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

diff --git a/README.md b/README.md
index ce10063..2a0e119 100644
--- a/README.md
+++ b/README.md
@@ -1,3 +1,5 @@
+# LALRPop
+
 LALRPop is a parser generator framework. Despite its name, it does not
 implement the LALR(1) algorithm, but rather LR(1). In fact, it has
 grand ambitions of eventually supporting all manner of parser
@@ -18,6 +20,7 @@ LALRPop has a number of nifty features:
    in an `if` expression.
 3. Compact defaults so that you can avoid writing action code much of the
    time.
+4. Type inference so you can often omit the types of nonterminals etc.   
    
 To be clear, LALRPop is barely functional. It's kind of spare time
 project. But it's coming along pretty quickly, now that a lot of the