Update models/Example36_Compiler1_ComponentReuse.mp,...

Update models/Example36_Compiler1_ComponentReuse.mp, models/Example37_Compiler2_ComponentReuse.mp files

models/Example36_Compiler1_ComponentReuse.mp

@@ -10,7 +10,7 @@ parser with lexical analyzer based on regular expression
 matching. It models the behavior of Lex/Yacc generated 
 compiler’s front end. This model represents an architecture 
 where lexer stores tokens in the intermediary data structure 
-before parser starts to access it, and Example 38 is a model 
+before parser starts to access it, and Example 37 is a model 
 where parser works with the lexer interactively. The Lexer 
 part models the behavior of a typical Lex machine. The 
 behavior of Stack is integrated into Parser’s behavior.
@@ -27,7 +27,7 @@ and the rest of the MP model. Interactions in MP
 descriptions (event grammar rules), and such adjustment 
 can be done in a declarative fashion by coordinating the 
 reusable MP code and the MP code under development. 
-Examples 37 and 38 show how it can be done using a model 
+Examples 36 and 37 show how it can be done using a model 
 of a compiler.
 
 References:

models/Example37_Compiler2_ComponentReuse.mp

@@ -8,7 +8,7 @@ of interactions between components.
 Description: Examples 36 and 37 are models of a bottom-up 
 parser with lexical analyzer based on regular expression 
 matching. It models the behavior of Lex/Yacc generated 
-compiler’s front end. Example 37 represents an 
+compiler’s front end. Example 36 represents an 
 architecture where lexer stores tokens in the intermediary 
 data structure before parser starts to access it, and this 
 is a model where parser works with the lexer interactively. 
@@ -26,7 +26,7 @@ and the rest of MP model. Interactions in MP (coordination
 operations) are separated from the behavior descriptions 
 (event grammar rules), and such adjustment can be done in 
 a declarative fashion by coordinating the reusable MP code 
-and the MP code under development. Examples 37 and 38 show 
+and the MP code under development. Examples 36 and 37 show 
 how it can be done using a model of a compiler.
 
 References: