diff --git a/README.md b/README.md
index 8a9e12156ddcd286ab33fe0747fef2566a8940e1..ee38406d600e9588ca95bd0c50d1d70c84087996 100644
--- a/README.md
+++ b/README.md
@@ -12,22 +12,22 @@ Compare return Left<right
 Equal return Left==right  
 //////////////////////////////////////////////////////////////
 
-1.UnaryRelation is removed.
+1. UnaryRelation is removed.
                           
-2.A new term ConstantNum:Term ::= <Num:double> is introduced for SelfCompare and SelfEq(now use Compare and Equal with the Right term as ConstantNum).
+2. A new term ConstantNum:Term ::= \<Num:double\> is introduced for SelfCompare and SelfEq(now use Compare and Equal with the Right term as ConstantNum).
 
-3.Term.eval() now has double as the type of return value. Therefore, Term.eval can be used by BinaryRelations for : eg. ID checking (int) or value checking (double).
+3. Term.eval() now has double as the type of return value. Therefore, Term.eval can be used by BinaryRelations for : eg. ID checking (int) or value checking (double).
 
-4.Subsetof:BinaryRelation is introduced to cover the case if A is a subset of B. Term.Set() is used to pass String[](or maybe just pass the HashSet) to Subsetof.eval().
+4. Subsetof:BinaryRelation is introduced to cover the case if A is a subset of B. Term.Set() is used to pass String[](or maybe just pass the HashSet) to Subsetof.eval().
 
 It is not instantiated in the Hanoi game.
 
-5.Constraint.check(Pillar P0, Pillar P1, boolean turn) is now devide to
+5. Constraint.check(Pillar P0, Pillar P1, boolean turn) is now devide to
 
 Constraint.oddTurn(Pillar P0, Pillar P1) and
 
 Constraint.evenTurn(Pillar P0, Pillar P1).
 
-6.Hanoi.present() is now named Hanoi.printResult().
+6. Hanoi.present() is now named Hanoi.printResult().
 
-7.The constraint for each move is printed as well in Constraint.oddTurn() and Constraint.EvenTurn().
+7. The constraint for each move is printed as well in Constraint.oddTurn() and Constraint.EvenTurn().