Although a polynomial time algorithm for this problem would not necessarily imply that P = NP, it would require progress on fundamental, well-studied problems in graph theory.
it does not seem possible to exploit the special structure of graphs derived from LCFRS productions.