Techniqueintro
Greedy parsing
Also called greedy LZ parsing, longest-match parsing.
Take the longest match available at each position; used by LZ77 and LZ78.
Take the longest match available at each position; used by LZ77 and LZ78.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 08SJN4 Edit this page History Report an error