Proof-Carrying Model for Parsing Techniques

作者: Mohamed A. El-Zawawy

DOI: 10.1007/978-3-319-09156-3_1

关键词: Rule of inferenceMachine learningTheoretical computer scienceComputer scienceSimple (abstract algebra)Artificial intelligenceLR parserParsing

摘要: This paper presents new approaches to common parsing algorithms. The approach utilizes the concept of inference rule. Therefore is simple, yet powerful enough overcome performance traditional techniques. basically composed systems rules.

参考文章(36)
Raúl Ernesto Gutiérrez de Piñerez Reyes, Juan Francisco Díaz Frias, Building a discourse parser for informal mathematical discourse in the context of a controlled natural language international conference on computational linguistics. pp. 533- 544 ,(2013) , 10.1007/978-3-642-37247-6_43
Ravi Sethi, Jeffrey D. Ullman, Alfred V. Aho, Compilers: Principles, Techniques, and Tools ,(1986)
Mohamed A. El-Zawawy, Distributed Data and Programs Slicing. arXiv: Programming Languages. ,(2014)
Michael L. Scott, Programming Language Pragmatics ,(1997)
Trevor Jim, Yitzhak Mandelbaum, A New Method for Dependent Parsing Programming Languages and Systems. ,vol. 6602, pp. 378- 397 ,(2011) , 10.1007/978-3-642-19718-5_20
Ceriel J. H. Jacobs, Dick Grune, Parsing Techniques: A Practical Guide ,(2007)
Faris Abou-Saleh, James Cheney, Jeremy Gibbons, James McKinna, Perdita Stevens, Notions of Bidirectional Computation and Entangled State Monads mathematics of program construction. pp. 187- 214 ,(2012) , 10.1007/978-3-319-19797-5_9
Arie Middelkoop, Atze Dijkstra, S. Doaitse Swierstra, Dependently typed attribute grammars implementation and application of functional languages. pp. 105- 120 ,(2010) , 10.1007/978-3-642-24276-2_7