Abstract
In the past few decades, computers have become most useful tool, and are being used in a variety of areas like Industry, educational institutions, University, Hospitals, Business, etc. In almost all these areas, algorithmic solutions to problems are common. The usage of both hardware and software is increasing drastically. Emphasis was given on the development of application software’s. The traditional approach of developing any software comprises of gathering the requirement from client organization, writing the specification and then developing the design of a system in the form of algorithm and afterward implementing this algorithm by using any programming language. Usually, the algorithm is written in a natural language which is either structured or unstructured and these are basically the pseudocodes and their implementation on programming languages change because of the syntax of the language. There is no defined way to implement an algorithm because the algorithm may be translated in more than one programming language and each translation produces different implementations. Even though, when two programmers translate the same algorithm using the same programming language the implementation differs. In this paper, we are proposing an automated tool which takes the input in the form of natural language statements (algorithm) then restructures the statements which are amenable for the further process. The restructuring statements are then converted to the equivalent C program. The proposed approach works on all the algorithms which are specified in the defined template.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Mukherjee S (2011) Automatic algorithm specification to source code translation(IJCSE). 2(2). ISSN: 0976-5166
Parekh V, Nilesh D (2016) Pseudocode to source code translation. Int J Emerg Technol Innov Res (JEITR) 3(11):47–52
Herbert Schildt (2006) In: Java the complete reference. 7th edn. Tata Mc Graw Hill publications. ISBN-13:978-0-07-226385-5
Aho AV, Hopcroft JE, Ullman JD (1975) In: The design and analysis of computer algorithm. Addison-wesley
Stubblebine T (1997) In: Regular expression pocket reference. O’reilly media, Inc
Cormen TH, Leiserson CE, Rivert RL (2009) In: Introduction to algorithm, 2nd edn. Massachusetts London, England McGraw-Hill Book Company, Cambride. ISBN:0-07-013151-1
Berset T (2011) MATLAB to fixed-point C code generation and its application to real-time HeartBeat detection
Sierra K, Bates B (2005) In: Head first Java, 2nd ed, O’reilly Media Inc. ISBN:9780596009205
Nisha NS, Mahesh HP (2014) Translation of english algorithm in C program using syntax directed translation schema, IJCSMC, vol 3, Issue 2
Clarke E, Kroening D, Sharygina N, Yorav K (2004) Predicate abstraction of ansi-C programs using sat, formal methods in system design, 25:105–127
Carlos CS (2011) Natural language programming using class sequential rules. In: IJCNLP, pp 237–245
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Kulkarni, R.N., Shenaz Begum, S. (2021). Abstraction of ‘C’ Program from Algorithm. In: Kumar, R., Quang, N.H., Kumar Solanki, V., Cardona, M., Pattnaik, P.K. (eds) Research in Intelligent and Computing in Engineering. Advances in Intelligent Systems and Computing, vol 1254. Springer, Singapore. https://doi.org/10.1007/978-981-15-7527-3_15
Download citation
DOI: https://doi.org/10.1007/978-981-15-7527-3_15
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-7526-6
Online ISBN: 978-981-15-7527-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)