test/check_cnp: working algorithm

I now have a working algorithm in test/check_cnp.  It can correctly
parse the grammar for an esoteric language called "Brainfuck".  This
language does not matter.  What matters is that it contains
parentheses.  So this shows that at least for grammars as complex as
parentheses, this parser works well.  Haha.

1 files changed, 28 insertions, 0 deletions

diff --git a/README b/README
index 5753ba3..d50ff3c 100644
--- a/README
+++ b/README
@@ -11,4 +11,32 @@ without warranty of any kind.
 About
 =====
 
+
 
+Similar projects
+================
+
+Some similar projects are listed below, along with some comparisons
+between this project and them.
+
+- Tree-sitter
+
+  This is a famous project, and I think it is really cool.  But my
+  goal is to provide the user with an "interactive tool" to manipulate
+  different context-free grammars, whereas Tree-sitter compiles the
+  grammars to static codes.
+
+  In addition, Tree-sitter implements the algorithm "GLR", which is an
+  abbreviation of "Generalized Left-to-right (reversed) Right-most"
+  algorithm.  It is in my humble opinion the most wide-spread
+  generalized parsing algorithm that has been implemented in other
+  places as well.  On the other hand, my aim is to implement many
+  parsing algorithms.  Right now I have only implemented the variant
+  of the "GLL" algorithm, called the "Clustered Non-terminal Parsing"
+  algorithm, but in the future I hope I will implement many more.
+
+- Emacs-Parser-Generator
+  <https://github.com/cjohansson/emacs-parser-generator>
+
+  This package seems interesting, as its whole codes are written in
+  Emacs Lisp.
\ No newline at end of file