After recent interception of a Void fleet by the Marshalship, a boarding team was able to commandeer The Eye of Multiplicity. This vessel, the ship of Damon Decantes, has given us plenty of insight into the workings of his creations and technology. Given his ability not only to multiply, but for each multiple to make full use of an individual’s productivity, it’s likely that focusing on deciphering such technology will extremely productive in turn, simply from frequency of exposure.<\/p>\n
That thought in mind, I’ve been working to create an interpreter for the primary language used on his ship. From what I’ve been able to deduce, it’s design is meant to be implemented as a simple but efficient functional language, and have been able to create an interpreter within one of our own in turn.<\/p>\n
Basic Values thus far have been defined by the following.<\/p>\n
i, j, k \u00e2\u02c6\u02c6 INT ::= ...|-2|-1|0|1|2|...<\/pre>\nb\u00c2\u00a0\u00c2\u00a0\u00c2\u00a0\u00c2\u00a0\u00c2\u00a0 \u00e2\u02c6\u02c6 BOOL::= True|False<\/pre>\nV, W\u00c2\u00a0\u00c2\u00a0 \u00e2\u02c6\u02c6 VAL ::= ()| [] | i | b | V : W | (V1, ..., Vn) | \\ (x1, ..., xn) -> M<\/pre>\nAnd Expression syntax has been given below.<\/p>\n
x, y, z \u00e2\u02c6\u02c6 VAR ::= ...| x | y | z | ... | temp | ...\r\nM, N, P \u00e2\u02c6\u02c6 EXP ::= V | x\r\n | not M | M&&N | M || N\r\n | M==N | M+N | M*N |\r\n | nil? M | head M | tail M | M : N\r\n | MN | (M1, ..., Mn)\r\n | if M then N else P\r\n | let (x1, ..., xn) = M in N<\/pre>\nGiven this expression syntax, there must also be some semblance of constraint rules, otherwise we can come up with garbage expressions (a head or tail operator on something other than a list type, for example).\u00c2\u00a0 Said constraints are upheld within the interpreter with an error wrapper. I’ll be looking to further this until I’ve encompassed the full language. Here is the working application thus far.<\/p>\n