Initial commit

Basic GNU standard files are added, and we now stop worrying about
monadic anamorphisms.

The current focus is on testing the correctness of the algorithm, so I
need convenient support for manipulating, interpreting, examining, and
per chance animating nondeterministic automata.

1 files changed, 21 insertions, 0 deletions

diff --git a/ChangeLog b/ChangeLog
new file mode 100644
index 0000000..a064c8c
--- /dev/null
+++ b/ChangeLog
@@ -0,0 +1,21 @@
+2022-11-15  Jean Sévère Durand  <durand@jsdurand.xyz>
+
+	* nfa: Stop worrying about monadic anamorphisms.
+
+	I was trying to design a way to use monadic anamorphisms to build
+	and parse regular expressions.  But, after some more thoughts, I
+	can only think about implementations that affect the performance
+	and are quite specifically tailored to my use-cases.  This means
+	the design is neither efficient nor generic.  So what is the use
+	of it anyways?
+
+	In the end, I decided to mildly generalize my usual pattern of
+	recursive descent parsing.  After all, my current focus is to
+	implement a version of NFA that can show me derivatives of the
+	atomic languages in a human-friendly and easy-to-use way.  This
+	will help me catch errors in my algorithms.
+
+2022-11-13  Jean Sévère Durand  <durand@jsdurand.xyz>
+
+	* gnu-standards: Add basic files required by the GNU standard.
+