Author： Scott Elizabeth Johnstone Adrian Economopoulos Rob
Publisher： Springer Publishing Company
ISSN： 0001-5903
Source： Acta Informatica, Vol.44, Iss.6, 2007-10, pp. : 427-461
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
A recognition and parsing algorithm for arbitrary conjunctive grammars
By Okhotin A.
Theoretical Computer Science, Vol. 302, Iss. 1, 2003-06 ,pp. :
Access to resources
Recommend
A Polynomial-Time Parsing Algorithm for K -Depth Languages
Journal of Computer and System Sciences, Vol. 52, Iss. 1, 1996-02 ,pp. :
Parsing schemata and correctness of parsing algorithms
By Sikkel K.
Theoretical Computer Science, Vol. 199, Iss. 1, 1998-06 ,pp. :
A Boyer-Moore-style algorithm for regular expression pattern matching
Science of Computer Programming, Vol. 48, Iss. 2, 2003-08 ,pp. :
Reducing non-determinism in right nulled GLR parsers
By Scott Elizabeth Johnstone Adrian
Acta Informatica, Vol. 40, Iss. 6-7, 2004-05 ,pp. :