clarity-pattern-parser 10.2.10 → 10.2.12

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "clarity-pattern-parser",
3
- "version": "10.2.10",
3
+ "version": "10.2.12",
4
4
  "description": "Parsing Library for Typescript and Javascript.",
5
5
  "main": "./dist/index.js",
6
6
  "module": "./dist/index.esm.js",
@@ -76,7 +76,7 @@ function createExpressionPattern() {
76
76
  ]);
77
77
 
78
78
  const expression = new ExpressionPattern("expression", [
79
- multDivExpression,
79
+ new RightAssociatedPattern(multDivExpression),
80
80
  addSubExpression,
81
81
  boolExpression,
82
82
  ternary,
@@ -100,20 +100,20 @@ describe("Expression Pattern", () => {
100
100
  test("Single Expression", () => {
101
101
  const expression = createExpressionPattern();
102
102
  let result = expression.exec("a || c || b / c * a + d");
103
- result = expression.exec("a + b");
104
- result = expression.exec("a + b * c * d");
105
- result = expression.exec("a + b * c || d + e");
106
- result = expression.exec("(a + b) * (c + d)");
107
- result = expression.exec("(a + b) * c + (d + e)");
108
- result = expression.exec("a + b * c ? d : e");
109
- result = expression.exec("a + b * (a + b * c ? d : e) ? d : e");
110
- result = expression.exec("a + b * a + b * c ? d : e ? d : e");
111
- result = expression.exec("a + b * ?");
103
+ result = expression.exec("a + b");
104
+ result = expression.exec("a + b * c * d");
105
+ result = expression.exec("a + b * c || d + e");
106
+ result = expression.exec("(a + b) * (c + d)");
107
+ result = expression.exec("(a + b) * c + (d + e)");
108
+ result = expression.exec("a + b * c ? d : e");
109
+ result = expression.exec("a + b * (a + b * c ? d : e) ? d : e");
110
+ result = expression.exec("a + b * a + b * c ? d : e ? d : e");
111
+ result = expression.exec("a + b * ?");
112
112
 
113
113
  expect(result).toBe(result);
114
114
  });
115
115
 
116
- test("Options like", ()=>{
116
+ test("Options like", () => {
117
117
  const expression = createOptionsExpression();
118
118
  const autoComplete = new AutoComplete(expression);
119
119
  const suggestion = autoComplete.suggestFor("a");
@@ -301,15 +301,15 @@ export class ExpressionPattern implements Pattern {
301
301
  }
302
302
  break;
303
303
  }
304
- }
305
-
304
+ }
305
+
306
306
  cursor.resolveError();
307
307
  cursor.moveTo(onIndex);
308
308
  }
309
309
 
310
- cursor.resolveError();
311
310
  onIndex = cursor.index;
312
311
  for (let i = 0; i < this._binaryPatterns.length; i++) {
312
+ cursor.resolveError();
313
313
  cursor.moveTo(onIndex);
314
314
 
315
315
  const pattern = this._binaryPatterns[i];
@@ -332,7 +332,7 @@ export class ExpressionPattern implements Pattern {
332
332
  lastBinaryNode = node;
333
333
  } else if (lastBinaryNode != null && lastUnaryNode != null && delimiterNode != null) {
334
334
  const precedence = this._precedenceMap[name];
335
- const lastPrecendece = lastBinaryNode == null ? 0 : this._precedenceMap[lastBinaryNode.name] || -1;
335
+ const lastPrecendece = lastBinaryNode == null ? 0 : this._precedenceMap[lastBinaryNode.name] == null ? -1 : this._precedenceMap[lastBinaryNode.name];
336
336
  const association = this._binaryAssociation[i];
337
337
 
338
338
  if (precedence === lastPrecendece && association === Association.right) {