Index: compile_rules_graph.py
==================================================================
--- compile_rules_graph.py
+++ compile_rules_graph.py
@@ -394,10 +394,11 @@
             print(sLine)
 
     # processing rules
     print("  preparing rules...")
     for sGraphName, lRuleLine in dAllGraph.items():
+        print("{:>8,} rules in {:<24} ".format(len(lRuleLine), "<"+sGraphName+">"), end="")
         lPreparedRule = []
         for i, sRuleGroup, sTokenLine, iActionBlock, sActions, nPriority in lRuleLine:
             for lRule in createRule(i, sRuleGroup, sTokenLine, iActionBlock, sActions, nPriority, dOptPriority, dDef):
                 lPreparedRule.append(lRule)
         # Graph creation

Index: darg.py
==================================================================
--- darg.py
+++ darg.py
@@ -15,11 +15,11 @@
 class DARG:
     """DIRECT ACYCLIC RULE GRAPH"""
     # This code is inspired from Steve Hanov’s DAWG, 2011. (http://stevehanov.ca/blog/index.php?id=115)
 
     def __init__ (self, lRule, sLangCode):
-        print(" > Direct Acyclic Rule Graph (DARG)", end=" ")
+        print(" > DARG", end="")
 
         # Preparing DARG
         self.sLangCode = sLangCode
         self.nRule = len(lRule)
         self.aPreviousRule = []