diff --git a/eo-phi-normalizer/grammar/EO/Phi/Syntax.cf b/eo-phi-normalizer/grammar/EO/Phi/Syntax.cf
index 40099c94c..1ba2696af 100644
--- a/eo-phi-normalizer/grammar/EO/Phi/Syntax.cf
+++ b/eo-phi-normalizer/grammar/EO/Phi/Syntax.cf
@@ -4,7 +4,10 @@
 --
 -- This is a non-ambiguous grammar for φ-programs.
 
-token Bytes ({"--"} | ["0123456789ABCDEF"] ["0123456789ABCDEF"] ({"-"} ["0123456789ABCDEF"] ["0123456789ABCDEF"])* {"--"}) ;
+token Bytes ({"--"}
+            | ["0123456789ABCDEF"] ["0123456789ABCDEF"] {"-"}
+            | (["0123456789ABCDEF"] ["0123456789ABCDEF"] {"-"} ["0123456789ABCDEF"] ["0123456789ABCDEF"])+)
+            ;
 token Function upper (char - [" \r\n\t,.|':;!-?][}{)(⟧⟦"])* ;
 token LabelId  lower (char - [" \r\n\t,.|':;!-?][}{)(⟧⟦"])* ;
 token AlphaIndex ({"α0"} | {"α"} (digit - ["0"]) (digit)* ) ;
@@ -27,7 +30,7 @@ separator Binding "," ;
 Phi.    Attribute ::= "φ" ;   -- decoratee object
 Rho.    Attribute ::= "ρ" ;   -- parent object
 Sigma.  Attribute ::= "σ" ;   -- home object
-VTX.    Attribute ::= "ν" ;   -- ???
+VTX.    Attribute ::= "ν" ;   -- an object that represents the unique identifier of the containing object
 Label.  Attribute ::= LabelId ;
 Alpha.  Attribute ::= AlphaIndex ;
 
diff --git a/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Abs.hs b/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Abs.hs
index 4ae129573..9a58833ce 100644
--- a/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Abs.hs
+++ b/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Abs.hs
@@ -1,4 +1,4 @@
--- File generated by the BNF Converter (bnfc 2.9.5).
+-- File generated by the BNF Converter (bnfc 2.9.6).
 {-# LANGUAGE DeriveDataTypeable #-}
 {-# LANGUAGE DeriveGeneric #-}
 {-# LANGUAGE GeneralizedNewtypeDeriving #-}
diff --git a/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Doc.txt b/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Doc.txt
index d611fb084..6e5dd3b6c 100644
--- a/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Doc.txt
+++ b/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Doc.txt
@@ -1,86 +1,86 @@
-The Language Syntax
-BNF Converter
-
-
-%Process by txt2tags to generate html or latex
-
-
-
-This document was automatically generated by the //BNF-Converter//. It was generated together with the lexer, the parser, and the abstract syntax module, which guarantees that the document matches with the implementation of the language (provided no hand-hacking has taken place).
-
-==The lexical structure of Syntax==
-
-===Literals===
-
-
-
-
-
-Bytes literals are recognized by the regular expression
-`````{"--"} | ["0123456789ABCDEF"] ["0123456789ABCDEF"] ('-' ["0123456789ABCDEF"] ["0123456789ABCDEF"])* {"--"}`````
-
-Function literals are recognized by the regular expression
-`````upper (char - ["
-
 !'(),-.:;?[]{|}⟦⟧"])*`````
-
-LabelId literals are recognized by the regular expression
-`````lower (char - ["
-
 !'(),-.:;?[]{|}⟦⟧"])*`````
-
-AlphaIndex literals are recognized by the regular expression
-`````{"α0"} | 'α' (digit - '0') digit*`````
-
-
-===Reserved words and symbols===
-The set of reserved words is the set of terminals appearing in the grammar. Those reserved words that consist of non-letter characters are called symbols, and they are treated in a different way from those that are similar to identifiers. The lexer follows rules familiar from languages like Haskell, C, and Java, including longest match and spacing conventions.
-
-The reserved words used in Syntax are the following:
-  | ``Δ`` | ``Φ`` | ``λ`` | ``ν``
-  | ``ξ`` | ``ρ`` | ``σ`` | ``φ``
-
-The symbols used in Syntax are the following:
-  | { | } | . | ⊥
-  | ↦ | ∅ | ⤍ | ,
-
-===Comments===
-There are no single-line comments in the grammar.There are no multiple-line comments in the grammar.
-
-==The syntactic structure of Syntax==
-Non-terminals are enclosed between < and >.
-The symbols -> (production),  **|**  (union)
-and **eps** (empty rule) belong to the BNF notation.
-All other symbols are terminals.
-
-  | //Program// | -> | ``{`` //[Binding]// ``}``
-  | //Object// | -> | ``{`` //[Binding]// ``}``
-  |  |  **|**  | //Object// ``{`` //[Binding]// ``}``
-  |  |  **|**  | //Object// ``.`` //Attribute//
-  |  |  **|**  | ``Φ`` ``.`` //Attribute//
-  |  |  **|**  | ``ξ`` ``.`` //Attribute//
-  |  |  **|**  | ``⊥``
-  | //Binding// | -> | //Attribute// ``↦`` //Object//
-  |  |  **|**  | //Attribute// ``↦`` ``∅``
-  |  |  **|**  | ``Δ`` ``⤍`` //Bytes//
-  |  |  **|**  | ``λ`` ``⤍`` //Function//
-  | //[Binding]// | -> | **eps**
-  |  |  **|**  | //Binding//
-  |  |  **|**  | //Binding// ``,`` //[Binding]//
-  | //Attribute// | -> | ``φ``
-  |  |  **|**  | ``ρ``
-  |  |  **|**  | ``σ``
-  |  |  **|**  | ``ν``
-  |  |  **|**  | //LabelId//
-  |  |  **|**  | //AlphaIndex//
-  | //PeeledObject// | -> | //ObjectHead// //[ObjectAction]//
-  | //ObjectHead// | -> | ``{`` //[Binding]// ``}``
-  |  |  **|**  | ``Φ``
-  |  |  **|**  | ``ξ``
-  |  |  **|**  | ``⊥``
-  | //ObjectAction// | -> | ``{`` //[Binding]// ``}``
-  |  |  **|**  | ``.`` //Attribute//
-  | //[ObjectAction]// | -> | **eps**
-  |  |  **|**  | //ObjectAction// //[ObjectAction]//
-
-
-
-%% File generated by the BNF Converter (bnfc 2.9.5).
+The Language Syntax
+BNF Converter
+
+
+%Process by txt2tags to generate html or latex
+
+
+
+This document was automatically generated by the //BNF-Converter//. It was generated together with the lexer, the parser, and the abstract syntax module, which guarantees that the document matches with the implementation of the language (provided no hand-hacking has taken place).
+
+==The lexical structure of Syntax==
+
+===Literals===
+
+
+
+
+
+Bytes literals are recognized by the regular expression
+`````{"--"} | ["0123456789ABCDEF"] ["0123456789ABCDEF"] '-' | (["0123456789ABCDEF"] ["0123456789ABCDEF"] '-' ["0123456789ABCDEF"] ["0123456789ABCDEF"])+`````
+
+Function literals are recognized by the regular expression
+`````upper (char - ["
+
 !'(),-.:;?[]{|}⟦⟧"])*`````
+
+LabelId literals are recognized by the regular expression
+`````lower (char - ["
+
 !'(),-.:;?[]{|}⟦⟧"])*`````
+
+AlphaIndex literals are recognized by the regular expression
+`````{"α0"} | 'α' (digit - '0') digit*`````
+
+
+===Reserved words and symbols===
+The set of reserved words is the set of terminals appearing in the grammar. Those reserved words that consist of non-letter characters are called symbols, and they are treated in a different way from those that are similar to identifiers. The lexer follows rules familiar from languages like Haskell, C, and Java, including longest match and spacing conventions.
+
+The reserved words used in Syntax are the following:
+  | ``Δ`` | ``Φ`` | ``λ`` | ``ν``
+  | ``ξ`` | ``ρ`` | ``σ`` | ``φ``
+
+The symbols used in Syntax are the following:
+  | { | } | . | ⊥
+  | ↦ | ∅ | ⤍ | ,
+
+===Comments===
+There are no single-line comments in the grammar.There are no multiple-line comments in the grammar.
+
+==The syntactic structure of Syntax==
+Non-terminals are enclosed between < and >.
+The symbols -> (production),  **|**  (union)
+and **eps** (empty rule) belong to the BNF notation.
+All other symbols are terminals.
+
+  | //Program// | -> | ``{`` //[Binding]// ``}``
+  | //Object// | -> | ``{`` //[Binding]// ``}``
+  |  |  **|**  | //Object// ``{`` //[Binding]// ``}``
+  |  |  **|**  | //Object// ``.`` //Attribute//
+  |  |  **|**  | ``Φ`` ``.`` //Attribute//
+  |  |  **|**  | ``ξ`` ``.`` //Attribute//
+  |  |  **|**  | ``⊥``
+  | //Binding// | -> | //Attribute// ``↦`` //Object//
+  |  |  **|**  | //Attribute// ``↦`` ``∅``
+  |  |  **|**  | ``Δ`` ``⤍`` //Bytes//
+  |  |  **|**  | ``λ`` ``⤍`` //Function//
+  | //[Binding]// | -> | **eps**
+  |  |  **|**  | //Binding//
+  |  |  **|**  | //Binding// ``,`` //[Binding]//
+  | //Attribute// | -> | ``φ``
+  |  |  **|**  | ``ρ``
+  |  |  **|**  | ``σ``
+  |  |  **|**  | ``ν``
+  |  |  **|**  | //LabelId//
+  |  |  **|**  | //AlphaIndex//
+  | //PeeledObject// | -> | //ObjectHead// //[ObjectAction]//
+  | //ObjectHead// | -> | ``{`` //[Binding]// ``}``
+  |  |  **|**  | ``Φ``
+  |  |  **|**  | ``ξ``
+  |  |  **|**  | ``⊥``
+  | //ObjectAction// | -> | ``{`` //[Binding]// ``}``
+  |  |  **|**  | ``.`` //Attribute//
+  | //[ObjectAction]// | -> | **eps**
+  |  |  **|**  | //ObjectAction// //[ObjectAction]//
+
+
+
+%% File generated by the BNF Converter (bnfc 2.9.6).
diff --git a/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Lex.x b/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Lex.x
index 6978d4e61..bcb8c56a3 100644
--- a/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Lex.x
+++ b/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Lex.x
@@ -1,4 +1,4 @@
--- -*- haskell -*- File generated by the BNF Converter (bnfc 2.9.5).
+-- -*- haskell -*- File generated by the BNF Converter (bnfc 2.9.6).
 
 -- Lexer definition for use with Alex 3
 {
@@ -40,7 +40,7 @@ $white+ ;
     { tok (eitherResIdent TV) }
 
 -- token Bytes
-\- \- | [0 1 2 3 4 5 6 7 8 9 A B C D E F][0 1 2 3 4 5 6 7 8 9 A B C D E F](\- [0 1 2 3 4 5 6 7 8 9 A B C D E F][0 1 2 3 4 5 6 7 8 9 A B C D E F]) * (\- \-)
+\- \- | [0 1 2 3 4 5 6 7 8 9 A B C D E F][0 1 2 3 4 5 6 7 8 9 A B C D E F]\- | ([0 1 2 3 4 5 6 7 8 9 A B C D E F][0 1 2 3 4 5 6 7 8 9 A B C D E F]\- [0 1 2 3 4 5 6 7 8 9 A B C D E F][0 1 2 3 4 5 6 7 8 9 A B C D E F]) +
     { tok (eitherResIdent T_Bytes) }
 
 -- token Function
diff --git a/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Par.y b/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Par.y
index e07d7cc2d..9fe41c67b 100644
--- a/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Par.y
+++ b/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Par.y
@@ -1,4 +1,4 @@
--- -*- haskell -*- File generated by the BNF Converter (bnfc 2.9.5).
+-- -*- haskell -*- File generated by the BNF Converter (bnfc 2.9.6).
 
 -- Parser definition for use with Happy
 {
diff --git a/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Print.hs b/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Print.hs
index 835a64076..cb3eb0312 100644
--- a/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Print.hs
+++ b/eo-phi-normalizer/src/Language/EO/Phi/Syntax/Print.hs
@@ -1,4 +1,4 @@
--- File generated by the BNF Converter (bnfc 2.9.5).
+-- File generated by the BNF Converter (bnfc 2.9.6).
 {-# LANGUAGE CPP #-}
 {-# LANGUAGE FlexibleInstances #-}
 {-# LANGUAGE LambdaCase #-}