Compiler algorithm language (CAL): an interpreter and compiler

Authors:
Abhinav Bhatele;Shubham Satyarth;Sanjeev K. Aggarwal
Affiliations:
Department of Computer Science and Engineering, IIT Kanpur, India;Department of Computer Science and Engineering, IIT Kanpur, India;Department of Computer Science and Engineering, IIT Kanpur, India
Venue:
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Year:
2007

Citing 4
Cited 0

Programming with sets; an introduction to SETL

Programming with sets; an introduction to SETL
Advanced compiler design and implementation

Advanced compiler design and implementation
Writing Compilers and Interpreters: An Applied Approach Using C++

Writing Compilers and Interpreters: An Applied Approach Using C++
LINUS: A structured language for instructional use

SIGCSE '74 Proceedings of the fourth SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have designed a Compiler Algorithm Language (CAL) to provide compiler writers with a language which is close to actual algorithmic notation. In this work, we have developed an interpreter and debugger for CAL which can be used by researchers for algorithm testing. We also provide a compiler that can translate CAL programs to C code which can be plugged elsewhere. We have provided a Graphical User Interface to make it convenient for the user to use the interpreter and compiler. Another feature of our system is web-enabling of the entire project so that a remote user would not have to download the entire code. Altogether, we have attempted to save the compiler writers from the trouble of writing lengthy programs for their algorithms.