1 files changed, 23 insertions, 0 deletions
diff --git a/content/zettel/3c3g2.md b/content/zettel/3c3g2.md
new file mode 100644
index 0000000..a0ce841
--- /dev/null
+++ b/content/zettel/3c3g2.md
@@ -0,0 +1,23 @@
++++
+title = "Linear predicated expressions"
+author = "Yann Herklotz"
+tags = []
+categories = []
+backlinks = ["3c3g1"]
+forwardlinks = ["3c3g1", "3c3g3"]
+zettelid = "3c3g2"
++++
+
+Instead of the recursive predicated expressions ([\#3c3g1]), one can
+create linear versions of those expressions, by basically flattening the
+trees into a single, non-recursive list.
+
+$$ P ::= [p?, e] $$
+
+There is always a direct possible translation between the recursive and
+linear representations, the backwards translation being trivial, as a
+linear representation is also a recursive one. The other direction is a
+bit more difficult, because one has to effectively multiply each of the
+expressions as one moves one level up.
+
+  [\#3c3g1]: /zettel/3c3g1