2 papers
cs.CC2007
A Counterexample to a Proposed Proof of P=NP by S. Gubin
Blake Hegerle
In a recent paper by S. Gubin [cs/0701023v1], a polynomial-time solution to the 3SAT problem was presented as proof that P=NP. The proposed algorithm cannot be made to work, which…
cs.PL2006
Parsing Transformative LR(1) Languages
Blake Hegerle
We consider, as a means of making programming languages more flexible and powerful, a parsing algorithm in which the parser may freely modify the grammar while parsing. We are part…