Escape (C) subsections so they don't show up as copyright symbol

Author: jjbohn

class.textile

@@ -1144,7 +1144,7 @@ the class can be found from the constant.
  193          rb_autoload_load(id);
  194      }
  195      if (rb_const_defined(rb_cObject, id)) {    /* (B) rb_const_defined */
- 196          klass = rb_const_get(rb_cObject, id);  /* (C) rb_const_get */
+ 196          klass = rb_const_get(rb_cObject, id);  /* ==(C)== rb_const_get */
  197          if (TYPE(klass) != T_CLASS) {
  198              rb_raise(rb_eTypeError, "%s is not a class", name);
  199          }                                      /* (D) rb_class_real */
@@ -1177,7 +1177,7 @@ libraries when some constants are accessed. This is done in the
 (B) We determine whether the `name` constant has been defined or not
 in `Object`.
 
-(C) Get the value of the `name` constant. This will be explained in
+==(C)== Get the value of the `name` constant. This will be explained in
 detail in chapter 6.
 
 (D) We've seen `rb_class_real()` some time ago. If the class `c` is a
@@ -1523,7 +1523,7 @@ h3. `include_class_new()`
  331      }
  332      klass->iv_tbl = RCLASS(module)->iv_tbl;     /* (B) */
  333      klass->m_tbl = RCLASS(module)->m_tbl;
- 334      klass->super = super;                       /* (C) */
+ 334      klass->super = super;                       /* ==(C)== */
  335      if (TYPE(module) == T_ICLASS) {             /* (D) */
  336          RBASIC(klass)->klass = RBASIC(module)->klass;   /* (D-1) */
  337      }
@@ -1546,7 +1546,7 @@ We're lucky there's nothing we do not know.
 (B) Transplant `module`'s instance variable and method tables into
 this class.
 
-(C) Make the including class's superclass (`super`) the super class of
+==(C)== Make the including class's superclass (`super`) the super class of
 this new class.
 
 In other words, this function creates an include class for the

evaluator.textile

@@ -623,7 +623,7 @@ if (RTEST(rb_eval(self, node->nd_cond))) {     (A)
     RETURN(rb_eval(self, node->nd_body));      (B)
 }
 else {
-    RETURN(rb_eval(self, node->nd_else));      (C)
+    RETURN(rb_eval(self, node->nd_else));      ==(C)==
 }
 </pre>
 
@@ -633,7 +633,7 @@ testing its value with @RTEST()@ .
 I've mentioned that @RTEST()@ is a macro to test whether or not
 a @VALUE@ is true of Ruby.
 If that was true, evaluating the @then@ side clause at (B).
-If false, evaluating the @else@ side clause at (C).
+If false, evaluating the @else@ side clause at ==(C)==.
 
 
 In addition, I've mentioned that @if@ statement of Ruby also has its own value,

gc.textile

@@ -1493,7 +1493,7 @@ This hook is called "finalizer".
  890                  }
  891                  n++;
  892              }
- 893  (C)         else if (RBASIC(p)->flags == FL_MARK) {
+ 893  ==(C)==         else if (RBASIC(p)->flags == FL_MARK) {
  894                  /* the objects that need to finalize */
  895                  /* are left untouched */
  896              }
@@ -1565,7 +1565,7 @@ It means that while executing the finalizers, one cannot use the hooked objects.
 The `for` in the last half is the main finalizing procedure.
 The `if` in the first half is the case when the execution could not be moved to
 the Ruby program for various reasons.
-The objects whose finalization is deferred will be appear in the route (C) of
+The objects whose finalization is deferred will be appear in the route ==(C)== of
 the previous list.
 
 

load.textile

@@ -591,7 +591,7 @@ load_file(fname, /* script=0 */)
         fclose(fp);
     }
     f = rb_file_open(fname, "r");       (B)
-    rb_compile_file(fname, f, 1);       (C)
+    rb_compile_file(fname, f, 1);       ==(C)==
     rb_io_close(f);
 }
 </pre>
@@ -609,7 +609,7 @@ loading error, but getting the errors related to `open`, for example
 `Errno::ENOENT`, `Errno::EACCESS`..., would be problematic. We are in
 `ruby.c` so we cannot stop a tag jump.
 
-(C) Using the parser interface `rb_compile_file()`, the program is
+==(C)== Using the parser interface `rb_compile_file()`, the program is
 read from an `IO` object, and compiled in a syntax tree. The syntax
 tree is added to `ruby_eval_tree` so there is no need to get the
 result.
@@ -942,7 +942,7 @@ First, let's start with the API code for the `dlopen` series.
 1324              dlclose(handle);
 1325              goto failed;
 1326          }
-1327          /* (C)Init_xxxx()を呼ぶ */
+1327          /* ==(C)==Init_xxxx()を呼ぶ */
 1328          (*init_fct)();
 1329
 1330          return handle;

module.textile

@@ -1330,7 +1330,7 @@ The method @initialize@ to initialize an object will unquestionably become @priv
 My feeling is that there're few cases @protected@ is required in Ruby.
 
 
-(C) This is a bug. I found this just before the submission of this book,
+==(C)== This is a bug. I found this just before the submission of this book,
 so I couldn't fix this beforehand.
 In the latest code this part is probably already removed.
 The original intention is to enforce the methods defined at top level to be @private@ .
@@ -2035,7 +2035,7 @@ Fig.9. assign when corresponded
 array and assign it into (the left-hand side expressed by) the @node->nd_args@ .
 
 
-(C) if there are remainders on the left-hand side, assign @nil@ to all of them.
+==(C)== if there are remainders on the left-hand side, assign @nil@ to all of them.
 
 
 

object.textile

@@ -815,7 +815,7 @@ how to get them.
  976              return generic_ivar_get(obj, id);
  977          break;
  978      }
-      /* (C) */
+      /* ==(C)== */
  979      rb_warning("instance variable %s not initialized", rb_id2name(id));
  980
  981      return Qnil;

parser.textile

@@ -1834,7 +1834,7 @@ h4. ヒアドキュメント
 2982      lex_strterm = rb_node_newnode(NODE_HEREDOC,
 2983                          rb_str_new(tok(), toklen()),  /* nd_lit */
 2984                          len,                          /* nd_nth */
-2985          /*(C)*/       lex_lastline);                /* nd_orig */
+2985          /*==(C)==*/       lex_lastline);                /* nd_orig */
 2986
 2987      return term == '`' ? tXSTRING_BEG : tSTRING_BEG;
 2988  }
@@ -1853,7 +1853,7 @@ h4. ヒアドキュメント
 (B)そしていきなり`lex_p`を行の末尾まで飛ばす。
 ということは、読み込み中の行のうち開始記号の後が読み捨てられて
 しまっている。この残りの部分はいつパースするのだろう。
-その謎の答えは(C)で`lex_lastline`(読み込み中の行)と
+その謎の答えは==(C)==で`lex_lastline`(読み込み中の行)と
 `len`(既に読んだ長さ)を保存しているところにヒントがある。
 
 では`heredoc_identifier()`前後の動的コールグラフを以下に簡単に示す。
@@ -1885,7 +1885,7 @@ here_document(NODE *here)
             line = lex_lastline;     /*(A)*/
             rb_str_cat(str, RSTRING(line)->ptr, RSTRING(line)->len);
             lex_p = lex_pend;        /*(B)*/
-            if (nextc() == -1) {     /*(C)*/
+            if (nextc() == -1) {     /*==(C)==*/
                 goto error;
             }
         } while (読み込み中の行が終了記号と等しくない);
@@ -1903,11 +1903,11 @@ here_document(NODE *here)
 `rb_str_cat()`はRubyの文字列の末尾に`char*`を連結する関数だ。
 つまり(A)では現在読み込み中の行`lex_lastline`を`str`に連結している。
 連結したらもう今の行は用済みだ。(B)で`lex_p`をいきなり行末に
-飛ばす。そして(C)が問題で、ここでは終了チェックをしているように
+飛ばす。そして==(C)==が問題で、ここでは終了チェックをしているように
 見せかけつつ実は次の「行」を読み込んでいるのだ。思い出してほしいの
 だが、`nextc()`は行が読み終わっていると勝手に次の行を読み込むという
 仕様だった。だから(B)で強制的に行を終わらせているので
-(C)で`lex_p`は次の行に移ることになる。
+==(C)==で`lex_p`は次の行に移ることになる。
 
 そして最後に`do`〜`while`ループを抜けて`heredoc_restore()`だ。
 

preface.textile

@@ -105,34 +105,34 @@ Part 4: Peripheral around the evaluator
 
 Supplementary chapters are included at the beginning of each part when
 necessary. These provide a basic introduction for those who are not familiar
-with Ruby and the general mechanism of a language processing system. 
+with Ruby and the general mechanism of a language processing system.
 
 
 Now, we are going through the overview of the four main parts. The symbol in
-parentheses after the explanation indicates the difficulty gauge. They are (C),
+parentheses after the explanation indicates the difficulty gauge. They are ==(C)==,
 (B), (A) in order of easy to hard, (S) being the highest.
 
 h4. Part 1: Object
 
-Chapter 1: Focuses the basics of Ruby to get ready to accomplish Part 1. (C)
-Chapter 2: Gives concrete inner structure of Ruby objects. (C)
-Chapter 3: States about hash table. (C)
+Chapter 1: Focuses the basics of Ruby to get ready to accomplish Part 1. ==(C)==
+Chapter 2: Gives concrete inner structure of Ruby objects. ==(C)==
+Chapter 3: States about hash table. ==(C)==
 Chapter 4: Writes about Ruby class system. You may read through this chapter quickly at first, because it tells plenty of abstract stories. (A)
 Chapter 5: Shows the garbage collector which is responsible for generating and releasing objects. The first story in low-level series. (B)
-Chapter 6: Describes the implementation of global variables, class variables, and constants. (C)
-Chapter 7: Outline of the security features of Ruby. (C)
+Chapter 6: Describes the implementation of global variables, class variables, and constants. ==(C)==
+Chapter 7: Outline of the security features of Ruby. ==(C)==
 
 h4. Part 2: Syntactic analysis
 
-Chapter 8: Talks about almost complete specification of the Ruby language, in order to prepare for Part 2 and Part 3. (C)
+Chapter 8: Talks about almost complete specification of the Ruby language, in order to prepare for Part 2 and Part 3. ==(C)==
 Chapter 9: Introduction to @yacc@ required to read the syntax file at least. (B)
 Chapter 10: Look through the rules and physical structure of the parser. (A)
 Chapter 11: Explore around the peripherals of @lex_state@, which is the most difficult part of the parser. The most difficult part of this book. (S)
-Chapter 12: Finalization of Part 2 and connection to Part 3. (C)
+Chapter 12: Finalization of Part 2 and connection to Part 3. ==(C)==
 
 h4. Part 3: Evaluator
 
-Chapter 13: Describe the basic mechanism of the evaluator. (C)
+Chapter 13: Describe the basic mechanism of the evaluator. ==(C)==
 Chapter 14: Reads the evaluation stack that creates the main context of Ruby. (A)
 Chapter 15: Talks about search and initialization of methods. (B)
 Chapter 16: Defies the implementation of the iterator, the most characteristic feature of Ruby. (A)