Parsing embedded expressions in strings

[raklaptudirm]

Problem

Mash defines embedded expressions in strings, in the format 'string [expression]', as per the current syntax definition. The problem with this is the fact that the lexer needs to perform some sort of bracket matching to determine which bracket defines the end of the expression, to lex them properly. But making the lexer do the parser's job is non-idiomatic.

Proposed Solutions

1. Switch to a new syntax which is easier to parse. For example, string {expression}, as { and } are not used in mash expressions.
2. Make the lexer perform bracket matching.

Propositions for other solutions are welcome.

[tjgurwara99]

From a personal perspective, the 1st proposed solution seems to be the correct way.

[raklaptudirm]

That is what I have implemented, but I wanted a better and more idiomatic option. For example, Javascript's template literals.

[tjgurwara99]

I don't know what you mean by idiomatic here.

That is what I have implemented

If you have already implemented a new syntax then I don't think this is a problem anymore right?

[raklaptudirm]

Consensus is switching to new syntax which is easier to lex:

_embedded_expression = "{" Expression "}" .

Expression will not contain any } characters which may interfere with properly lexing the template literal.