You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
When the lexer and new parser was written, we also talked about adding string interpolation to normal strings and not just extern definitions. Was there a particular reason we withheld from implementing this feature request back then other than the detours listed here, @b-studios?
Do we want to allow using string templates for pattern matching on string literals? If so, then so some of the proposed shortcuts will probably not work.
Do we want to allow using string templates for pattern matching on string literals?
I wouldn't do that for now, that seems like a separate (& much more difficult issue).
I'd still probably lex it even there, and then reject it in the pattern matching compiler to preserve reasonable error msgs.
Currently, we don't parse string templates in normal strings.
As a first step, we could allow at least arguments which are already strings like:
This would involve:
${ ... }
to appear in normal strings)Template[...]
insource.Tree
String
sThere are some interesting detours/shortcuts:
show
on the splices instead (probably horrible to use because of the error messages)def infixConcat(s1, s2) = "${s1}${s2}"
The text was updated successfully, but these errors were encountered: