<s>
In	O
natural	B-Language
language	I-Language
processing	I-Language
,	O
deterministic	B-Application
parsing	I-Application
refers	O
to	O
parsing	B-Language
algorithms	O
that	O
do	O
not	O
backtrack	B-Algorithm
.	O
</s>
<s>
LR-parsers	O
are	O
an	O
example	O
.	O
</s>
<s>
The	O
deterministic	O
behavior	O
is	O
desired	O
and	O
expected	O
in	O
compiling	B-Language
programming	O
languages	O
.	O
</s>
<s>
In	O
natural	B-Language
language	I-Language
processing	I-Language
,	O
it	O
was	O
thought	O
for	O
a	O
long	O
time	O
that	O
deterministic	B-Application
parsing	I-Application
is	O
impossible	O
due	O
to	O
ambiguity	O
inherent	O
in	O
natural	O
languages	O
(	O
many	O
sentences	O
have	O
more	O
than	O
one	O
plausible	O
parse	B-Language
)	O
.	O
</s>
<s>
Thus	O
,	O
non-deterministic	O
approaches	O
such	O
as	O
the	O
chart	B-Application
parser	I-Application
had	O
to	O
be	O
applied	O
.	O
</s>
