BlockComment | Xcode source editor extension for Swift

Something like this should work:

Whenever there are problems when parsing, you should check what kind of tokens the lexer is producing.

Here are the tokens that you lexer produces:

Based on the suggestion by Koenig Lear, I filtered all comments with an regex before running the text through the parser. This is maybe not the nicest option, but it does the job reliable with only two lines of code.

You have every textarea bound to the same formControlName="comments". One form control - one value. You need FormArray instead.

The property blockComment will not play well with the FormArray. It would be more practical to store all the data in the FormArray instead of spreading it among the blockComment and the FormArray.

PS you need manual call to detect changes because this.blockComment.push does not update the reference which is in the blockComment. More details about arrays and change detection in this articcle.

makeExprParser termParser [precN, ..., prec1] will produce an expression parser that works in such a way that each level of precedence invokes the next-higher level of precedence. So if you'd manually define it, you'd have a rule for infix + and -, which uses the mult-and-div rule as the operands. That in turn would use the prefix rule as the operands and that would use the ^ rule as the operand. Finally the ^ rule uses termParser for the operands.

The important thing to note here is that the ^ rule (or more generally: any rule with a higher precedence than the prefix operators) invokes a parser that won't accept prefix operators at the beginning. So prefix operators can't appear on the right of such operators (except inside parentheses).

What this basically means is that your use case is not supported by makeExprParser.

To work around this, you can use makeExprParser to only handle the infix operators with a lower precedence than the prefix operators and then handle the prefix operators and ^ manually, so that the right operand of ^ would "loop back" to the prefix operators. Something like this:

If you are serializing the JSON as a dictionary which you are because you're doing:

Few things:

• skippers are inherited by the surrounding context
• you didn't have lexeme[] around the "tokens" in the header guards, so it would match including the typedefstruct because space also includes line-ends.

You can simplify things:

Live On Coliru

In your grammar, a statement is an exp. You probably meant exp ';'.

As written, a block is statement* and that can match exp exp. Since ID is an exp and double and a are both IDs, double a is recognised as two consecutive statements.

Also, your grammar recognises declaration* ';' as a statement. Since declaration* includes the case of zero declarations -- that is, the empty string -- a lone ; matches that production. I don't know if that is really what you want, but I strongly suspect that you did not want to match two consecutive declaration without a semicolon separating them.

I tried and solved my own problem.

The trick is newline should be skipped like this grammar below, it should not use channel(HIDDEN).