Quellcode durchsuchen

Updated docs, to accord with PR #980

tags/gm/2021-09-23T00Z/github.com--lark-parser-lark/0.12.0
Erez Sh vor 3 Jahren
Ursprung
Commit
20f57b9e40
1 geänderte Dateien mit 4 neuen und 3 gelöschten Zeilen
  1. +4
    -3
      docs/grammar.md

+ 4
- 3
docs/grammar.md Datei anzeigen

@@ -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.



Laden…
Abbrechen
Speichern