Non-deterministic polynomial time algorithm

Advanced Algorithms Analysis and Design - Lecture 44: NP completeness. In this lecture we will cover the following: NP completeness; polynomial time algorithms; decision and optimization problems; nondeterministic problems; nondeterministic algorithm; boolean combinational circuit; NP-completeness proof basis;...

35p andromedashun 26-05-2022 8 1   Download

We introduce an algorithm for designing a predictive left to right shift-reduce non-deterministic push-down machine corresponding to an arbitrary unrestricted context-free grammar and an algorithm for efficiently driving this machine in pseudo-parallel. The performance of the resulting parser is formally proven to be superior to Earley's parser (1970). The technique employed consists in constructing before run-time a parsing table that encodes a nondeterministic machine in the which the predictive behavior has been compiled out. ...

8p bunmoc_1 20-04-2013 51 3   Download