diff --git a/cfg_utils.py b/cfg_utils.py
index cd4e16107bfd1458786dbc6e0697ebc37560fc3e..9fd94a65ae103134134579da4f9c8fb3097e6115 100644
--- a/cfg_utils.py
+++ b/cfg_utils.py
@@ -210,6 +210,18 @@ while True:
         break
 
 
+
+
+# We use the "sandwich" technique in https://notebook.drmaciver.com/posts/2020-07-11-10:49.html
+
+
+# Here, c(n) represents the number of total strings in the language that are of length exactly n
+
+
+
+
+
+
 # Furthermore, we also note that the description of a context-free grammar is *itself* context-free
 # so if we take the CFG-description grammar (BNF or something isomorphic to it), and use Boltzmann
 # sampling on *it*, we will generate candidate grammars; which will be used to test the FPGA-based