OASIcs.SLATE.2016.10.pdf
- Filesize: 427 kB
- 8 pages
Document
Context-Free Grammars: Exercise Generation and Probabilistic Assessment
Authors
-
Part of:
Volume:
5th Symposium on Languages, Applications and Technologies (SLATE'16) (SLATE 2016)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Languages, Applications and Technologies (SLATE) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2016-06-21
Cite AsGet BibTex
José João Almeida, Eliana Grande, and Georgi Smirnov. Context-Free Grammars: Exercise Generation and Probabilistic Assessment. In 5th Symposium on Languages, Applications and Technologies (SLATE'16). Open Access Series in Informatics (OASIcs), Volume 51, pp. 10:1-10:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/OASIcs.SLATE.2016.10
https://doi.org/10.4230/OASIcs.SLATE.2016.10
Abstract
In this paper we present a metagrammar based algorithm for exercise generation in the domain of context-free grammars. We also propose a probabilistic assessment algorithm based on a new identity theorem for formal series, a matrix version of the well-known identity theorem from the theory of analytic functions.
Keywords
- Exercise generation
- context-free grammars
- assessment
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 1986.
-
Marco Almeida, Nelma Moreira, and Rogerio Reis. Testing equivalence of regular languages. Journal of Automata, Languages and Combinatorics, 15(1/2), 2010.
-
Marco Almeida, Nelma Moreira, and Rogerio Reis. Finite automata minimization algorithms. In Jiacun Wang, editor, Handbook of Finite State Based Models and Applications, Discrete Mathematics and Its Applications, pages pp.145-170. Chapman and Hall/CRC Press, 2012.
-
Richard Demillo and Richard Lipton. A probabilistic remark on algebraic program testing. Information Processing Letters, 7(4):pp. 193-195, 1978.
- Robert Heckendorn. A grammar for the C- programming language. Technical Report Version S16, Department of Computer Science - University of Idaho, 2016. URL: http://marvin.cs.uidaho.edu/Teaching/CS445/c-Grammar.pdf.
- Daan Leijen and Erik Meijer. Parsec: Direct style monadic parser combinators for the real world. Technical report, Department of Computer Science, University of Utrecht, 2001. URL: http://research.microsoft.com/pubs/65201/parsec-paper-letter.pdf.
-
Jerrold E. Marsden and Michael J. Hoffman. Basic Complex Analysis. W. H. Freeman, third edition, 1999.
-
Minh Luan Nguyen, Siu Cheung Hui, and Alvis C. M. Fong. Probabilistic equivalence verification approach for automatic mathematical solution assessment. In 23rd International Joint Conference on Artificial Intelligence (IJCAI2013), pages pp. 1352-1356, 2013.
-
Arto Salomaa. Formal Languages. Academic Press, 1973.
-
Arto Salomaa and Matti Soittola. Automata-theoretic aspects of formal power series. Springer, 1978.
- S. Doaitse Swierstra. Combinator parsers: From toys to tools. Electronic Notes in Theoretical Computer Science, 41, 2001. URL: http://dx.doi.org/10.1016/S1571-0661(05)80545-6.
- Harald Heinz Vogt, S. Doaitse Swierstra, and Matthijs F. Kuiper. Higher order attribute grammars. SIGPLAN Not., 24(7):131-145, June 1989. URL: http://dx.doi.org/10.1145/74818.74830.