lourenco/mgmt
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

lang: Add function values and lambdas

Browse Source 
This adds a giant missing piece of the language: proper function values!
It is lovely to now understand why early programming language designers
didn't implement these, but a joy to now reap the benefits of them. In
adding these, many other changes had to be made to get them to "fit"
correctly. This improved the code and fixed a number of bugs.
Unfortunately this touched many areas of the code, and since I was
learning how to do all of this for the first time, I've squashed most of
my work into a single commit. Some more information:

* This adds over 70 new tests to verify the new functionality.

* Functions, global variables, and classes can all be implemented
natively in mcl and built into core packages.

* A new compiler step called "Ordering" was added. It is called by the
SetScope step, and determines statement ordering and shadowing
precedence formally. It helped remove at least one bug and provided the
additional analysis required to properly capture variables when
implementing function generators and closures.

* The type unification code was improved to handle the new cases.

* Light copying of Node's allowed our function graphs to be more optimal
and share common vertices and edges. For example, if two different
closures capture a variable $x, they'll both use the same copy when
running the function, since the compiler can prove if they're identical.

* Some areas still need improvements, but this is ready for mainstream
testing and use!
This commit is contained in:
James Shubin
2019-06-04 21:51:21 -04:00
parent 4f1c463bdd
commit f53376cea1
189 changed files with 7170 additions and 849 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
pgraph/graphviz.go
View File

@@ -19,6 +19,7 @@ package pgraph // TODO: this should be a subpackage
import (
"fmt"
"html"
"io/ioutil"
"os"
"os/exec"
@@ -26,6 +27,11 @@ import (
"syscall"
)
const (
ptrLabels = true
ptrLabelsSize = 10
)
// Graphviz outputs the graph in graphviz format.
// https://en.wikipedia.org/wiki/DOT_%28graph_description_language%29
func (g *Graph) Graphviz() (out string) {
@@ -45,18 +51,32 @@ func (g *Graph) Graphviz() (out string) {
out += fmt.Sprintf("\tlabel=\"%s\";\n", g.GetName())
//out += "\tnode [shape=box];\n"
str := ""
// XXX: add determinism to this loop
for i := range g.Adjacency() { // reverse paths
v1 := strconv.Quote(i.String()) // 1st vertex
out += fmt.Sprintf("\t\"%p\" [label=%s];\n", i, v1)
v1 := html.EscapeString(i.String()) // 1st vertex
if ptrLabels {
text := fmt.Sprintf("%p", i)
small := fmt.Sprintf("<FONT POINT-SIZE=\"%d\">%s</FONT>", ptrLabelsSize, text)
out += fmt.Sprintf("\t\"%p\" [label=<%s<BR />%s>];\n", i, v1, small)
} else {
out += fmt.Sprintf("\t\"%p\" [label=<%s>];\n", i, v1)
}
for j := range g.Adjacency()[i] {
k := g.Adjacency()[i][j]
//v2 := strconv.Quote(j.String()) // 2nd vertex
e := strconv.Quote(k.String()) // edge
//v2 := html.EscapeString(j.String()) // 2nd vertex
e := html.EscapeString(k.String()) // edge
// use str for clearer output ordering
//if fmtBoldFn(k) { // TODO: add this sort of formatting
// str += fmt.Sprintf("\t\"%s\" -> \"%s\" [label=\"%s\",style=bold];\n", i, j, k)
// str += fmt.Sprintf("\t\"%s\" -> \"%s\" [label=<%s>,style=bold];\n", i, j, k)
//} else {
str += fmt.Sprintf("\t\"%p\" -> \"%p\" [label=%s];\n", i, j, e)
if false { // XXX: don't need the labels for edges
text := fmt.Sprintf("%p", k)
small := fmt.Sprintf("<FONT POINT-SIZE=\"%d\">%s</FONT>", ptrLabelsSize, text)
str += fmt.Sprintf("\t\"%p\" -> \"%p\" [label=<%s<BR />%s>];\n", i, j, e, small)
} else {
str += fmt.Sprintf("\t\"%p\" -> \"%p\" [label=<%s>];\n", i, j, e)
}
//}
}
}