瀏覽代碼

Updated docs, to accord with PR #980

tags/gm/2021-09-23T00Z/github.com--lark-parser-lark/0.12.0
Erez Sh 3 年之前
父節點
當前提交
20f57b9e40
共有 1 個檔案被更改,包括 4 行新增3 行删除
  1. +4
    -3
      docs/grammar.md

+ 4
- 3
docs/grammar.md 查看文件

@@ -159,14 +159,15 @@ start : (A | B)+
A : "a" | "ab"
B : "b"
```
We get this behavior:
We get only one possible derivation, instead of two:

```bash
>>> p = Lark(g, ambiguity="explicit")
>>> p.parse("ab")
Tree(start, [Token(A, 'a'), Token(B, 'b')])
Tree('start', [Token('A', 'ab')])
```

This is happening because Python's regex engine always returns the first matching option.
This is happening because Python's regex engine always returns the best matching option. There is no way to access the alternatives.

If you find yourself in this situation, the recommended solution is to use rules instead.



Loading…
取消
儲存