DOCSLIB.ORG

Review Thanks!

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Review Thanks! CS 242 Thanks! Review Teaching Assistants • Mike Cammarano • TJ Giuli • Hendra Tjahayadi John Mitchell Graders • Andrew Adams Tait Larson Final Exam • Kenny Lau Aman Naimat • Vishal Patel Justin Pettit Wednesday Dec 8 8:30 – 11:30 AM • and more … Gates B01, B03 Course Goals There are many programming languages Understand how programming languages work Early languages Appreciate trade-offs in language design • Fortran, Cobol, APL, ... Be familiar with basic concepts so you can Algol family understand discussions about • Algol 60, Algol 68, Pascal, …, PL/1, … Clu, Ada, Modula, • Language features you haven’t used Cedar/Mesa, ... • Analysis and environment tools Functional languages • Implementation costs and program efficiency • Lisp, FP, SASL, ML, Miranda, Haskell, Scheme, Setl, ... • Language support for program development Object-oriented languages • Smalltalk, Self, Cecil, … • Modula-3, Eiffel, Sather, … • C++, Objective C, …. Java General Themes in this Course Concurrent languages Language provides an abstract view of machine • Actors, Occam, ... • We don’t see registers, length of instruction, etc. • Pai-Lisp, … The right language can make a problem easy; Proprietary and special purpose languages wrong language can make a problem hard • Could have said a lot more about this • TCL, Applescript, Telescript, ... Language design is full of difficult trade-offs • Postscript, Latex, RTF, … • Expressiveness vs efficiency, ... • Domain-specific language • Important to decide what the language is for Specification languages • Every feature requires implementation data structures • CORBA IDL, ... and algorithms • Z, VDM, LOTOS, VHDL, … 1 Good languages designed with specific A good language design presents abstract goals (often an intended application) machine, an idealized view of computer • C: systems programming • Lisp: cons cells, read-eval-print loop • Lisp: symbolic computation, automated reasoning • FP: ?? • FP: functional programming, algebraic laws • ML: functions are basic control structure, memory model • ML: theorem proving includes closures and reference cells • Clu, ML modules: modular programming • C: the underlying machine + abstractions • Simula: simulation • Simula: activation records and stack; object references • Smalltalk: Dynabook, • Smalltalk: objects and methods • C++: add objects to C • C++: ?? • Java: set-top box, internet programming • Java: Java virtual machine Design Issues Language design involves many trade-offs In general, high-level languages/features are: • space vs. time • slower than lower-level languages • efficiency vs. safety – C slower than assembly • efficiency vs. flexibility – C++ slower than C – Java slower than C++ • efficiency vs. portability • provide for programs that would be • static detection of type errors vs. flexibility difficult/impossible otherwise • simplicity vs. "expressiveness" etc – Microsoft Word in assembly language? These must be resolved in a manner that is – Extensible virtual environment without objects? • consistent with the language design goals – Concurrency control without semaphores or monitors? • preserves the integrity of abstract machine Many program properties are undecidable (can't determine statically ) Languages are still evolving • Halting problem • Object systems • nil pointer detection • Adoption of garbage collection • alias detection • Concurrency primitives; abstract view of concurrent • perfect garbage detection systems • etc. • Domain-specific languages Static type systems • Network programming • detect (some) program errors statically • Aspect-oriented programming and many other “fads” – Every good idea is a fad until is sticks • can support more efficient implementations • are less flexible than either no type system or a dynamic one 2 Summary of the course Lisp Summary Lisp, 1960 Modularity and objects Successful language Fundamentals • encapsulation • Symbolic computation, experimental programming • lambda calculus • dynamic lookup Specific language ideas • denotational semantics • subtyping • Expression-oriented: functions and recursion • functional prog • inheritance • Lists as basic data structures ML and type systems Simula and Smalltalk • Programs as data, with universal function eval Block structure and C++ • Stack implementation of recursion via "public pushdown list" activation records Java • Idea of garbage collection. Exceptions and Concurrency continuations Fundamentals Algol Family and ML Grammars, parsing Evolution of Algol family Lambda calculus • Recursive functions and parameter passing Denotational semantics • Evolution of types and data structuring Functional vs. Imperative Programming ML: Combination of Lisp and Algol-like features • Is implicit parallelism a good idea? • Expression-oriented • Is implicit anything a good idea? • Higher-order functions • Garbage collection • Abstract data types • Module system • Exceptions Types and Type Checking Type inference algorithm Types are important in modern languages Example • Program organization and documentation - fun f(x) = 2+x; Graph for λx. ((plus 2) x) • Prevent program errors > val it = fn : int → int • Provide important information to compiler t→int = int→int How does this work? λ Type inference int (t = int) • Determine best type for an expression, based on Assign types to leaves @ known information about symbols in the expression Propagate to internal @ int→int x : t Polymorphism nodes and generate : int • Single algorithm (function) can have many types constraints + 2 int → int → int Overloading real → real→real • Symbol with multiple meanings, resolved at compile Solve by substitution time 3 Block structure and storage mgmt Summary of scope issues Block-structured languages and stack storage Block-structured lang uses stack of activ records In-line Blocks • Activation records contain parameters, local vars, … • activation records • Also pointers to enclosing scope • storage for local, global variables Several different parameter passing mechanisms First-order functions Tail calls may be optimized • parameter passing Function parameters/results require closures • tail recursion and iteration • Closure environment pointer used on function call Higher-order functions • Stack deallocation may fail if function returned from call • deviations from stack discipline • Closures not needed if functions not in nested blocks • language expressiveness => implementation complexity Control Modularity and Data Abstraction Structured Programming Step-wise refinement and modularity • Go to considered harmful • History of software design Exceptions Language support for information hiding • “structured” jumps that may return a value • Abstract data types • dynamic scoping of exception handler • Datatype induction Continuations • Packages and modules • Function representing the rest of the program Generic abstractions • Generalized form of tail recursion • Datatypes and modules with type parameters • Design of STL Concepts in OO programming Simula 67 Four main language ideas First object-oriented language • Encapsulation Designed for simulation • Dynamic lookup • Later recognized as general-purpose prog language • Subtyping Extension of Algol 60 • Inheritance Standardized as Simula (no “67”) in 1977 Why OOP ? Inspiration to many later designers • Extensible abstractions; separate interface from impl • Smalltalk Compare oo to conventional (non-oo) lang • C++ • Can represent encapsulation and dynamic lookup • ... • Need inheritance and subtyping as basic constructs 4 Objects in Simula Smalltalk Class Major language that popularized objects • A procedure that returns a pointer to its activation record Developed at Xerox PARC 1970’s (Smalltalk-80) Object Object metaphor extended and refined • Activation record produced by call to a class • Used some ideas from Simula, but very different lang Object access • Everything is an object, even a class • Access any local variable or procedures using dot • All operations are “messages to objects” notation: object. • Very flexible and powerful language Memory management – Similar to “everything is a list” in Lisp, but more so • Objects are garbage collected Method dictionary and lookup procedure • Simula Begin pg 48-49: user destructors undesirable • Run-time search; no static type system Independent subtyping and inheritance C++ Examples Design Principles: Goals, Constraints If circle <: shape, then Object-oriented features • Some good decisions, some problem areas circle → shape Classes, Inheritance and Implementation • Base class and Derived class (inheritance) circle → circle shape → shape • Run-time structures: offset known at compile time Subtyping shape → circle • Subtyping principles • Abstract base classes • Specializing types of public members C++ compilers recognize limited forms of function subtyping Multiple Inheritance Subtyping with functions Java function subtyping class Point { class ColorPoint: public Point { Signature Conformance public: Inherited, but repeated public: • Subclass method signatures must conform to those of int getX(); here for clarity int getX(); superclass virtual Point *move(int); int getColor(); protected: ... ColorPoint * move(int); Argument types, Return type, Exceptions: void darken(int); private: ... How much conformance is really needed? protected: ... }; private: ... Java rule }; • Arguments and returns must have identical types, may remove exceptions In principle: can have ColorPoint <: Point In practice: some compilers allow, others have not This is covariant case; contravariance is another story 5 A
Load more

Recommended publications
  • SETL for Internet Data Processing
    SETL for Internet Data Processing by David Bacon A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy Computer Science New York University January, 2000 Jacob T. Schwartz (Dissertation Advisor) c David Bacon, 1999 Permission to reproduce this work in whole or in part for non-commercial purposes is hereby granted, provided that this notice and the reference http://www.cs.nyu.edu/bacon/phd-thesis/ remain prominently attached to the copied text. Excerpts less than one PostScript page long may be quoted without the requirement to include this notice, but must attach a bibliographic citation that mentions the author’s name, the title and year of this disser- tation, and New York University. For my children ii Acknowledgments First of all, I would like to thank my advisor, Jack Schwartz, for his support and encour- agement. I am also grateful to Ed Schonberg and Robert Dewar for many interesting and helpful discussions, particularly during my early days at NYU. Terry Boult (of Lehigh University) and Richard Wallace have contributed materially to my later work on SETL through grants from the NSF and from ARPA. Finally, I am indebted to my parents, who gave me the strength and will to bring this labor of love to what I hope will be a propitious beginning. iii Preface Colin Broughton, a colleague in Edmonton, Canada, first made me aware of SETL in 1980, when he saw the heavy use I was making of associative tables in SPITBOL for data processing in a protein X-ray crystallography laboratory.
    [Show full text]
  • Introduction to Python
    Introduction to Python Programming Languages Adapted from Tutorial by Mark Hammond Skippi-Net, Melbourne, Australia [email protected] http://starship.python.net/crew/mhammond What Is Python? Created in 1990 by Guido van Rossum While at CWI, Amsterdam Now hosted by centre for national research initiatives, Reston, VA, USA Free, open source And with an amazing community Object oriented language “Everything is an object” 1 Why Python? Designed to be easy to learn and master Clean, clear syntax Very few keywords Highly portable Runs almost anywhere - high end servers and workstations, down to windows CE Uses machine independent byte-codes Extensible Designed to be extensible using C/C++, allowing access to many external libraries Python: a modern hybrid A language for scripting and prototyping Balance between extensibility and powerful built-in data structures genealogy: Setl (NYU, J.Schwartz et al. 1969-1980) ABC (Amsterdam, Meertens et al. 1980-) Python (Van Rossum et all. 1996-) Very active open-source community 2 Prototyping Emphasis on experimental programming: Interactive (like LISP, ML, etc). Translation to bytecode (like Java) Dynamic typing (like LISP, SETL, APL) Higher-order function (LISP, ML) Garbage-collected, no ptrs (LISP, SNOBOL4) Prototyping Emphasis on experimental programming: Uniform treatment of indexable structures (like SETL) Built-in associative structures (like SETL, SNOBOL4, Postscript) Light syntax, indentation is significant (from ABC) 3 Most obvious and notorious features Clean syntax plus high-level data types Leads to fast coding Uses white-space to delimit blocks Humans generally do, so why not the language? Try it, you will end up liking it Variables do not need declaration Although not a type-less language A Digression on Block Structure There are three ways of dealing with IF structures Sequences of statements with explicit end (Algol-68, Ada, COBOL) Single statement (Algol-60, Pascal, C) Indentation (ABC, Python) 4 Sequence of Statements IF condition THEN stm; stm; .
    [Show full text]
  • Understanding Programming Languages
    Understanding Programming Languages M. Ben-Ari Weizmann Institute of Science Originally published by John Wiley & Sons, Chichester, 1996. Copyright °c 2006 by M. Ben-Ari. You may download, display and print one copy for your personal use in non-commercial academic research and teaching. Instructors in non-commerical academic institutions may make one copy for each student in his/her class. All other rights reserved. In particular, posting this document on web sites is prohibited without the express permission of the author. Contents Preface xi I Introduction to Programming Languages 1 1 What Are Programming Languages? 2 1.1 The wrong question . 2 1.2 Imperative languages . 4 1.3 Data-oriented languages . 7 1.4 Object-oriented languages . 11 1.5 Non-imperative languages . 12 1.6 Standardization . 13 1.7 Computer architecture . 13 1.8 * Computability . 16 1.9 Exercises . 17 2 Elements of Programming Languages 18 2.1 Syntax . 18 2.2 * Semantics . 20 2.3 Data . 21 2.4 The assignment statement . 22 2.5 Type checking . 23 2.6 Control statements . 24 2.7 Subprograms . 24 2.8 Modules . 25 2.9 Exercises . 26 v Contents vi 3 Programming Environments 27 3.1 Editor . 28 3.2 Compiler . 28 3.3 Librarian . 30 3.4 Linker . 31 3.5 Loader . 32 3.6 Debugger . 32 3.7 Profiler . 33 3.8 Testing tools . 33 3.9 Configuration tools . 34 3.10 Interpreters . 34 3.11 The Java model . 35 3.12 Exercises . 37 II Essential Concepts 38 4 Elementary Data Types 39 4.1 Integer types .
    [Show full text]
  • Introduction to Python.Pdf
    Module 1 - Introduction to Python Introduction to Python What is Python? Python is a multi-paradigm high-level general purpose scripting language. Python supports multiple programming paradigms (models) like structured programming, object- oriented programming, and functional programming. So, it is called a multi-paradigm language. Python is user friendly and can be used to develop application software like text editors, music players, etc. So, it is called a high-level language. Python has several built-in libraries. There are also many third-party libraries. With the help of all these libraries we develop almost anything with Python. So, it is called a general purpose language. Finally, Python programs are executed line by line (interpreted). So, it is called a scripting language. Who Created Python? Python was created by Guido Van Rossum. He worked at Google from 2005-2012. From 2013 onwards he is working at Dropbox. Guido Van Rossum was fond of a British comedian group named Monty Python. Their BBC series was Flying Circus. Rossum named the language after them (Monty Python). History of Python • Python implementation began in 1989. • Python is a successor to ABC language (itself inspired by SETL). • First official release on 20 Feb 1991. • Python 2.0 was released on 16 Oct 2000. • Python 3.0 was released on 3 Dec 2008. • Latest stable release is Python 3.6.1 released in Mar. 2017. Need for Python Programming Following are some of the main reasons for learning Python language: Software quality: Python code is designed to be readable, and hence reusable and maintainable much more than traditional scripting languages.
    [Show full text]
  • The Setl Programmi G La Guage
    THE SETL PROGRAMMIG LAGUAGE TAPASYA PATKI POOJA BHANDARI Department of Computer Science University of Arizona Abstract This paper presents a study on the language SETL, which is a very-high level, wide spectrum programming language based on the mathematical theory of sets, primarily used for transformational programming, compiler optimization, algorithm design and data processing. We describe the language features and delve into the issues from the compiler’s perspective. 1 HISTORY In the late 1960s, researchers were addressing compiler optimization problems, and a need for an expressive, high-level language that supported set-intensive algorithm design was felt. SETL, introduced by Prof. Jacob Schwartz at the New York University (NYU) at the Courant Institute of Mathematical Sciences in 1970, was conceived to meet this purpose. Prof. Schwartz, who obtained his PhD from Yale University in 1951, is a renowned mathematician and a computer scientist, and currently holds professorship at NYU. Most of the research and developmental work related to SETL has been carried out at NYU. Modern computer programming languages can be broadly grouped into Object-Oriented languages, Functional programming languages, and Scripting languages. Since SETL was developed during 1970s, SETL does not strictly belong to the above classification. While SETL provides no support for object- orientation, newer versions and dialects of SETL, like SETL2 and ISETL support object oriented and graphics programming. SETL is a very powerful language, and has various application domains. The first ADA translator, ADA/Ed and the first implementation of AIML, the markup language for Artificial Intelligence, were written in it. Python’s predecessor ABC, is also heavily influenced by SETL.
    [Show full text]
  • Writing Cybersecurity Job Descriptions for the Greatest Impact
    Writing Cybersecurity Job Descriptions for the Greatest Impact Keith T. Hall U.S. Department of Homeland Security Welcome Writing Cybersecurity Job Descriptions for the Greatest Impact Disclaimers and Caveats • Content Not Officially Adopted. The content of this briefing is mine personally and does not reflect any position or policy of the United States Government (USG) or of the Department of Homeland Security. • Note on Terminology. Will use USG terminology in this brief (but generally translatable towards Private Sector equivalents) • Job Description Usage. For the purposes of this presentation only, the Job Description for the Position Description (PD) is used synonymously with the Job Opportunity Announcement (JOA). Although there are potential differences, it is not material to the concepts presented today. 3 Key Definitions and Concepts (1 of 2) • What do you want the person to do? • Major Duties and Responsibilities. “A statement of the important, regular, and recurring duties and responsibilities assigned to the position” SOURCE: https://www.opm.gov/policy-data- oversight/classification-qualifications/classifying-general-schedule-positions/classifierhandbook.pdf • Major vs. Minor Duties. “Major duties are those that represent the primary reason for the position's existence, and which govern the qualification requirements. Typically, they occupy most of the employee's time. Minor duties generally occupy a small portion of time, are not the primary purpose for which the position was established, and do not determine qualification requirements” SOURCE: https://www.opm.gov/policy-data- oversight/classification-qualifications/classifying-general-schedule-positions/positionclassificationintro.pdf • Tasks. “Activities an employee performs on a regular basis in order to carry out the functions of the job.” SOURCE: https://www.opm.gov/policy-data-oversight/assessment-and-selection/job-analysis/job_analysis_presentation.pdf 4 Key Definitions and Concepts (2 of 2) • What do you want to see on resumes that qualifies them to do this work? • Competency.
    [Show full text]
  • A Set Based Programming Abstraction for Wireless Sensor Networks
    µSETL: A Set Based Programming Abstraction for Wireless Sensor Networks Mohammad Sajjad Hossain, A.B.M. Alim Al Islam, Milind Kulkarni, Vijay Raghunathan School of ECE, Purdue University, West Lafayette, IN 47907 {sajjad, abmalima, milind, vr}@purdue.edu ABSTRACT such as energy conservation, climate change, healthcare, trans- Programming wireless sensor networks is a major challenge, even portation, etc. Networked embedded systems, such as wireless sen- for experienced programmers. To alleviate this problem, prior work sor networks (WSNs), form a crucial building block for realizing has proposed a paradigm shift from node-level microprogramming large-scale CPSs and have received considerable research attention. to macroprogramming, where the user specifies a distributed ap- While this has resulted in numerous technological advances (e.g., plication using a single macroprogram that is automatically trans- a plethora of tiny, cheap, and low-power sensor platforms is now lated into a set of node-level microprograms. This paper makes the available [1]), the problem of programming a distributed wireless case that node-level microprogramming itself can be made much sensor network still remains a major challenge and a potential show easier by using the right set of programming abstractions. To sup- stopper to widespread adoption. This challenge is best exemplified port this claim, this paper presents µSETL, a programming abstrac- by the following quote from a recent EE Times article [2]: tion for sensor networks based on set theory. Sets offer a power- "Programming the software that manages applications run- ful formalism and high expressiveness, yet are a natural way of ning on wireless sensor and control networks is currently so thinking about resource abstraction in sensor networks.
    [Show full text]
  • Comparative Programming Languages CM20253
    We have briefly covered many aspects of language design And there are many more factors we could talk about in making choices of language The End There are many languages out there, both general purpose and specialist And there are many more factors we could talk about in making choices of language The End There are many languages out there, both general purpose and specialist We have briefly covered many aspects of language design The End There are many languages out there, both general purpose and specialist We have briefly covered many aspects of language design And there are many more factors we could talk about in making choices of language Often a single project can use several languages, each suited to its part of the project And then the interopability of languages becomes important For example, can you easily join together code written in Java and C? The End Or languages And then the interopability of languages becomes important For example, can you easily join together code written in Java and C? The End Or languages Often a single project can use several languages, each suited to its part of the project For example, can you easily join together code written in Java and C? The End Or languages Often a single project can use several languages, each suited to its part of the project And then the interopability of languages becomes important The End Or languages Often a single project can use several languages, each suited to its part of the project And then the interopability of languages becomes important For example, can you easily
    [Show full text]
  • Implementation of a Subset of Modes in an Algol 68 Compiler
    ' . I ' ' IMPLEMENTATION OF A SUBSET OF MODES IN AN ALGOL 68 COMPILER By WALTER MICHAEL SEAY 1\ ' Bachelor of Science Troy State University Troy, Alabama 1974 Submitted to the Faculty of the Graduate College of the Oklahoma State University in partial fulfillment of the requirements for the Degree of MASTER OF SCIENCE July, 1976 IMPLEMENTATION OF A SUBSET OF MODES IN AN ALGOL 68 COMPILER Thesis Approveda Thes~~e:ser ~~ ' 953416 ii PREFACE This thesis is a description .of the mode facilities which have been added to the Oklahoma State University ALGOL 68 Compiler. Also included is a description of the changes that were required to update the language accepted by the compiler in accordance with the newest definition. I would like to thank the faculty of the Computing and Information Sciences Department for their assistance and their desire to teach. A special th~ks is in order to my advisor, Dr. G. E. Hedrick, for his invaluable assistance and understanding during my stay at Oklahoma State University. I would also like to thank my two sons, Bobby and Johnny, who often were required to be quieter than little boys should ever .have to be. It is impossible for me to express properly my thanks to my wife, Kathy, who did so much more than type. iii TABLE OF CONTENTS Chapter Page I. INTRODUCTION ••••••••• • • • • • • • • • 1 Objectives • • • • • • • • • • , • . • - • • • • 1 History of the Oklahoma State University ALGOL 68 Compiler • • • • • • • • • • • • 2 Literature Review • • • • • • • • • • • • • 4 II. ALGOL 68 MODES • • • • • • • • • • • • • • • • • 7 Introduction • • • • • • • • ~ • • • • • • • 7 Tools for Building New Modes • • • • • • • • 8 The Subset of Modes Chosen for Implementation • • • • • -.
    [Show full text]
  • Setlx — a Tutorial Version 2.2.0
    SetlX — A Tutorial Version 2.2.0 Karl Stroetmann Duale Hochschule Baden-W¨urttemberg Stuttgart [email protected] Tom Herrmann Duale Hochschule Baden-W¨urttemberg Stuttgart [email protected] August 13, 2013 Abstract In the late sixties, Jack Schwartz, a renowned professor of mathematics at the Courant Institute for Mathematical Sciences in New York, developed a very high level programming language called Setl [Sch70, SDSD86]. The most distinguishing feature of this language is the support it offers for sets and lists. This feature permits convenient implementations of mathematical algorithms: As set theory is the language of mathematics, many mathematical algorithms that are formulated in terms of set theory have very straightforward implementations in Setl. Unfortunately, at the time of its invention, Setl did not get the attention that it deserved. One of the main reasons was that Setl is an interpreted language and in those days, the run time overhead of an interpreter loop was not yet affordable. More than forty years after the first conception of Setl, the efficiency of computers has changed dramatically and for many applications, the run time efficiency of a languange is no longer as important as it once was. After all, modern scripting languages like Python [vR95] or Ruby [FM08] are all interpreted and noticeably slower than compiled languages like C, but this fact hasn’t impeded their success. At the Baden-W¨urttemberg Corporate State University, the first author has used Setl2 [Sny90] for several years in a number of introductory computer science courses. He has noticed that the adoption of Setl has made the abstract concepts of set theory tangible to the students.
    [Show full text]
  • Tech-Bytes Newsletter December 2020 PYTHON and DATA SCIENCE TECHNOLOGY
    tech-bytes Newsletter December 2020 PYTHON AND DATA SCIENCE TECHNOLOGY Python is an interpreted, object-oriented, high-level programming language DEPARTMENT OF with dynamic semantics. Its high-level built in data structures, combined COMPUTER SCIENCE with dynamic typing and dynamic binding; Make it very attractive for Rapid Application Development, as well as for use as a scripting or glue language to connect existing components together. Python's simple, easy to learn syntax emphasizes readability and therefore reduces the cost of program maintenance. Python supports modules and packages, which encourages program modularity and code reuse. The Python interpreter and the extensive standard library are available in source or binary form without charge for all major platforms, and can be freely distributed. HISTORY Python was conceived in the late 1980s by Guido van Rossum at Centrum Wiskunde & Informatica (CWI) in the Netherlands as a successor to ABC programming language, which was inspired by SETL), capable of exception handling and interfacing with the Amoeba operating system. Its implementation began in December 1989. Van Rossum shouldered sole responsibility for the project, as the lead developer, until 12 July 2018, when he announced his "permanent vacation" from his responsibilities as Python's Benevolent Dictator For Life, a title the Python community bestowed upon him to reflect his long-term commitment as the project's chief decision-maker. GUIDO VAN ROSSUM Guido Van Rossum is one of the world’s most influential programmers. Van Rossum is the author of the general purpose programming language python, which he started working on in 1989, and is now among the most popular languages in use.
    [Show full text]
  • The Complete Study on Python Scripting Language and Its GUI's
    Vol-4 Issue-4 2018 IJARIIE-ISSN(O)-2395-4396 The complete study on Python scripting language and its GUI’s Geluvaraj. B1, Satwik.PM2 ,Dr.T.A. Ashok Kumar3 , 1Research Scholar, Dept of Computation Science and IT, Garden city University, Bangalore, Indi 2Research schloar, Dept of Computation Science and IT, Garden city University, Bangalore, India, 3Associate Professor, Dept of Computation Science and IT, Garden city University, Bangalore, India ABSTRACT Python uses an elegant syntax, making the programs you write easier to read. It’s an easy-to-use language that makes it simple to get your program working. This makes Python ideal for prototype development and other ad-hoc programming tasks, without compromising maintainability. It comes with a large standard library that supports many common programming tasks such as connecting to web servers, searching text with regular expressions, reading and modifying files. Python's interactive mode makes it easy to test short snippets of code. There's also a bundled development environment called IDLE. It’s easily extended by adding new modules implemented in a compiled language such as C or C++. It can also be embedded into an application to provide a programmable interface. Python runs anywhere, including Mac OS X, Windows, Linux, and UNIX, with unofficial builds also available for Android and iOS.[1] Keywords:- Python2, python3,cpyth on(compiler python), Thonny(python IDE), tk GUI(toolkit Graphical User Interface) 1.Introduction Python was conceived in the late 1980s, and its implementation began in December 1989 by Guido van Rossum at Centrum Wiskunde & Informatica (CWI) in the Netherlands as a successor to the ABC language (itself inspired by SETL) capable of exception handling and interfacing with the AMOEBA Operating System.
    [Show full text]