Coherent AString and Lexeme implementation.

A Lexeme is any "token" read from input, a lexeme has not yet beeen parsed
and could parse to anything, e.g. a string, an expression, a number, etc.
Lexemes are not (yet?) exposed to the language or ever compiled.

A String is a string literal, which can contain any character directly
except " and \.  There are two special escapes: \" and \\, any other
character following a \ is a syntax error.

Fix garbage collection of REPL objects, leading to type errors from
type variable re-use because a type variable for a given AST's /address/
exists, but that address has actually been deleted and reused by new
(i.e. make top level REPL expressions and types be GC roots).


git-svn-id: http://svn.drobilla.net/resp/resp@261 ad02d1e2-f140-0410-9f75-f8b11f17cedd

1 files changed, 6 insertions, 0 deletions

diff --git a/src/constrain.cpp b/src/constrain.cpp
index 94a27c3..969e87d 100644
--- a/src/constrain.cpp
+++ b/src/constrain.cpp
@@ -40,6 +40,12 @@ AString::constrain(TEnv& tenv, Constraints& c) const throw(Error)
 }
 
 void
+ALexeme::constrain(TEnv& tenv, Constraints& c) const throw(Error)
+{
+	c.constrain(tenv, this, tenv.named("Lexeme"));
+}
+
+void
 ASymbol::constrain(TEnv& tenv, Constraints& c) const throw(Error)
 {
 	const AType** ref = tenv.ref(this);