CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Empirical Analysis of Context Free Grammars and Parse Trees

by J. Sreedhar, S. Viswanadha Raju, A. Vinaya Babu
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 98 - Number 6
Year of Publication: 2014
Authors: J. Sreedhar, S. Viswanadha Raju, A. Vinaya Babu
10.5120/17191-7379

J. Sreedhar, S. Viswanadha Raju, A. Vinaya Babu . Empirical Analysis of Context Free Grammars and Parse Trees. International Journal of Computer Applications. 98, 6 ( July 2014), 38-40. DOI=10.5120/17191-7379

@article{ 10.5120/17191-7379,
author = { J. Sreedhar, S. Viswanadha Raju, A. Vinaya Babu },
title = { Empirical Analysis of Context Free Grammars and Parse Trees },
journal = { International Journal of Computer Applications },
issue_date = { July 2014 },
volume = { 98 },
number = { 6 },
month = { July },
year = { 2014 },
issn = { 0975-8887 },
pages = { 38-40 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume98/number6/17191-7379/ },
doi = { 10.5120/17191-7379 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:25:32.451965+05:30
%A J. Sreedhar
%A S. Viswanadha Raju
%A A. Vinaya Babu
%T Empirical Analysis of Context Free Grammars and Parse Trees
%J International Journal of Computer Applications
%@ 0975-8887
%V 98
%N 6
%P 38-40
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This research explores the impact of Context Free Grammars (CFG) and Parse Trees for construction of a Telugu Language Sentences. Based on the CFG here we derived the derivations for the respective strings. Later we constructed the Parser Trees for the above said strings. Finally we analysed whether the string is ambiguous or unambiguous. Here for analysis we considered the Large Scale Open Source Telugu carpus.

References
  1. Aho, A. V. , and Johnson, S. C.
  2. . "LR parsing," Computing Surveys 6:2, 99-124.
  3. Aho, A. V. , and Johnson, S. C. , and Ullman, J. D.
  4. . "Deterministic parsing of ambiguous grammars," Comm. ACM 18:8, 441-452.
  5. Aho, A. V. , and Peterson, T. G,
  6. . "A minimum distance error correcting parser for context-free languages," SIAM J. Computing 1:4, 305-312.
  7. Aho, A. V. , and Ullman, J. D. [1972b]. The Theory of Parsing Translation and Compiling, Vol. I:Parsing, Prentice-Hall, Englewood Cliffs, N. J.
  8. Aho, A. V. , and Ullman, J. D. [1972c]. "Optimization of LR(k) parsers," J. Computer and systems Sciences 6:6, 573-602.
  9. Aho, A. V. , and Ullman, J. D. [1972a]. The Theory of Parsing, Translation and Compiling, Vol. II: Compiling, Prentice- Hall, Englewood Cliffs, N. J.
  10. Aho, A. V. , and Ullman, J. D. [1972b]. " A technique for speeding up LR(k) parsers. " SIAM J. Computing 2:2, 106-127.
  11. Anderson, J. P.
  12. . "A note on some compiling algorithms," comn. ACM 7:3, 149-153.
  13. Anderson, T. , Eve, J. , and Horning, J. J.
  14. . " Efficient LR(1) paresers," Acta Informatica 2:1, 12-39.
  15. Backhouse, R. C.
  16. . "An alternative approach to the improvement of LR parsers," Acta Informatica 6:3, 277-296.
  17. Bar Hillel, Y. , Perles, M. , and Shamir, E.
  18. . "On formal properties of simple phrase structure grammers," Z. Phonetik, Sprachwissenschaft und Kommunikationsforschung 14, pp. 143-172.
  19. Barnard, D. T.
  20. . "A survey of syntax error handling techniques," Computer Science Reaserch Group, Univ. of Toronto, Toronto, Ont. , Canada.
  21. Birman, A. , and Ullman, J. D.
  22. . "Parsing algorithms with backtrack," Information and Control 23:1, 1-34.
  23. Bochmann, G. V.
  24. . "Semantic evaluation from left to right," Comm. ACM 19:2, 55-62.
  25. Brzozowiski, J. A.
  26. . "Derivatives of regular expressions," J. ACM 11:4, 481-488.
  27. Cheatham, T. E. Jr. , and Sattley, K.
  28. . "Syntax directed compiling," Proc. AFIPS 1964 Spring Joint Computer Conf. Spartan Books, Baltimore Md. , 31-57.
  29. Chomsky, N.
  30. . "On Certain formal properties of grammers," Information and Control 2:2, 137-167.
Index Terms

Computer Science
Information Sciences

Keywords

CFG Parse Trees Derivations

Powered by PhDFocusTM