In computer science, a chart parser is a type of parser suitable for ambiguous grammars (including grammars of natural languages). It uses the dynamic programming approach—partial hypothesized results are stored in a structure called a chart and can be re-used. This eliminates backtracking and prevents a combinatorial explosion.
Chart parsing is generally credited to Martin Kay.

University of Cambridge Computer Laboratory, and SRI ... 'Parsing' is the term
used to describe the process of automatically building syntac- ... quirements: to
some extent, they are covered by the companion section on 'Chart parsing'. 1 ...

The algorithmic details of the head-corner parser are not easy. Therefore we will
make some effort to convey the intuition behind the parser. To that end, we first
define a left-corner chart parser in Section 3 and afterwards generalize this to a ...

times, we need to find some way to reuse (partial) parse trees that we have
already found. Because ... 3.2.2 Chart parsing and Tabulation In order to store
intermediate parse results in a way that allows for an efficient retrieval, we use a
table.

Parsing of single sentences is not obviously suited to loosely coupled parallel
systems. ... Since this is a primary characteristic of the active Chart parsing
methodology, my investigations have focussed on parallel implementations of
active chart ...

Pratt's (1975) algorithm is sometimes considered to be a generalized LC method,
but it is perhaps better described as CKY parsing with top-down filtering added.
Kay's (1980) method for undirected bottom-up Chart parsing is clearly left-corner ...