blob: a0ce84152a3e43982730e8fc3b1b9c30c0f535aa (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
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
|
