Solution of Limit Problems with Symbolic Computation

AYDOĞDU M. C., PEHLİVAN H.

24th Signal Processing and Communication Application Conference (SIU), Zonguldak, Türkiye, 16 - 19 Mayıs 2016, ss.2005-2008 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası:
  • Doi Numarası: 10.1109/siu.2016.7496162
  • Basıldığı Şehir: Zonguldak
  • Basıldığı Ülke: Türkiye
  • Sayfa Sayıları: ss.2005-2008
  • Karadeniz Teknik Üniversitesi Adresli: Evet

Özet

In this paper, the solution of limit problems, which is an important subject of high school and university mathematics is presented by using JavaCC code generation tool and symbolic computation methods. Although JavaCC is generally used for generating programming language interpreters, in a similar way it can also be used in the evaluation of mathematical expressions. In this work, first the general grammar rules of limit expressions is extracted. Then parser code for the limit expressions is generated with JavaCC according to the grammar rules. Using the list of the tokens into which a limit expression is parsed with this code, an Abstract Syntax Tree (AST) is constructed. Finally, the solution is obtained by interpreting the AST with a class of Visitor Design Pattern. The study can be regarded as a promising contribution to computer assisted education.