Murali Chemuturi · Chapman & Hall/CRC eBooks · 2018
All the preliminary prerequisites are covered thus far, and now we are ready to plunge into programming. A computer program is comprised of statements given in the sequential order of their processing by the computer. This chapter explains the basics of program statements. The general characters of a computer program statement are enumerated. Then the syntax that needs to be adhered to while writing a program statement is explained, and the common rules that need to be conformed to are explained. Then all the statements, namely declaration statements, assignment statements, input/output statements, Control statements, loops, error handling statements, system calls, inter-process communication, interrupt handling, device handling, starting and ending statements, and documentation statements, are all enumerated and briefly explained. The single statements and compound statements are contrasted. Then the assignment statements are explained in detail with examples. The rules to be adhered to while writing assignment statements are described in detail to make the reader an expert in writing them. Combining assignment statements and initialization is also discussed here. The utility of assignment statements in a computer program are detailed in this chapter.
Cited by 0
Vreda Pieterse, Estelle Taylor · Computer Science Education Research Conference · 2018
The assignment statement is a basic programming operation which is used to assign a value to a variable. The assignment statement is needed in all programs which manipulate data. Most programmers assume that this statement is trivial and therefore should not pose conceptual problems for novice programmers. This article investigates the validity of this assumption. We describe a number of misconceptions of the assignment statement in the form of inappropriate mental models for the assignment statement. These were established through a literature review. We used a questionnaire to identify the prior programming experience of the students in a cohort of 1058 students enrolled for an introductory programming course. We classify the respondents into three categories namely those who have never programmed before; those who have previously tried but failed the introductory programming course; and those who claim that they have had prior programming experience. We then asked the students to complete ten questions which ask the outcome of a short program executing assignment statements. The multiple choice questions were designed to identify the mental model of the respondent regarding the assignment statement for a number of cases. We compare the occurrence of correct and wrong metal models in the three groups and discuss our observations as well as their consequences for teaching introductory programming.
Cited by 3
Claude Delannoy · 1989
Cited by 0
A. J. Tyrrell · Palgrave Macmillan UK eBooks · 1989
This chapter discusses the concept of assignment, introduces the COBOL verbs which can be used to assign values to data items, provides extensive treatment of the MOVE verb, and introduces figurative constants. Fuller coverage of the COMPUTE verb is delayed until chapter 3.
Cited by 0
David J. Gries · IEEE Transactions on Software Engineering · 1978
The conventional axiomatic definitions are given for multiple assignment to simple variables and for assignment to a single subscripted variable, along with examples to illustrate their use. The original contributions of this paper are the extension of the definition to include multiple assignment to several subscripted variables, and the development of a nontrivial, practical algorithm in which multiple assignment to several subscripted variables is indeed useful. Arguments are given to support the conjecture that the use of subscripted variables, like the use of pointers, can lead to exponential explosion of the length of a proof (and thus of the time needed to understand a program) unless the programmer is careful.
Cited by 31
Irv Kalb · Apress eBooks · 2016
This chapter covers the following topics: These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Cited by 0
Irv Kalb · Apress eBooks · 2018
This chapter covers the following topics:
Cited by 0
J.W. deBakker · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 1976
Correctness proofs for assignment statements are usually based on Hoare's or Floyd's assignment axiom.We observe.thatthese axioms do not apply (directly) to assignment to subscripted variables.A refined definition of substitution for subscripted variables is proposed which preserves the validity of Hoare's axiom, and which is used in the formulation of an extension of Floyd's axiom.For both axioms, a validity proof is given within the framework of denotational semantics of Scott and Strachey.Moreover, it is shown that they yield the weakest precondition and strongest postcondition, respectively.
Cited by 0Open access
Michael Kupferschmid · CRC Press eBooks · 2002
Cited by 0
Michael Kupferschmid · CRC Press eBooks · 2009
Cited by 0
CRC Press eBooks · 2002
Cited by 0
Robert W. Floyd · Communications of the ACM · 1960
It is not possible, by testing symbol pairs only [2], to determine whether a given symbol string is consistent with the formation rules of ALGOL [1]. For example, the formula l 1: l 2: x[i := 5j + 3.14.159; violates four distinct formation rules of ALGOL, yet each pair of adjacent characters may appear in permissible formulae. The algorithm described here will determine, with minor restrictions, whether a particular symbol string is a permissible ALGOL assignment statement. I believe that the same technique may be extended to determine whether a given symbol string is a permissible ALGOL program or not, where a program is defined as a sequence of permissible statements separated by semicolons. The algorithm scans the formula from left to right, replacing certain character pairs by single characters. If under the allowable transformations the symbol string may be reduced to the single character Σ, it is a well-formed formula in ALGOL; otherwise it violates the formation rules.
Cited by 3Open access
J.W. deBakker · Stichting Mathematisch Centrum. Rekenafdeling · 1968
Cited by 8
Harry F. Jordan, B.J. Smith · Computer · 1977
The basic character of a programming language or a hardware design language is determined by the data types on which it operates and how changes in their values are made. Few of the papers on specific hardware design languages have included a discussion of this basic part, of the languages' semantics. Often a heuristic discussion based on examples is taken as the most rapid way of conveying the flavor of a new language. Since the range of language applications is often limited by the available data types and the transformations which may be applied to them, a careful analysis of this area of language structure is essential. It is not the intent of this paper to define another hardware description language. Instead, we want to propose a basic set of data types and assignment statements which should be available in any general-purpose hardware description language.
Cited by 2
Athanassios Jimoyiannis · 2013
Abstract. Introductory programming seems far from being successful at both university and high school levels. Research data already published offer significant knowledge regarding university students ’ deficiencies in computer programming and the alternative representations they built about abstract programming constructs. However, secondary education students ’ learning and development in computer programming has not been extensively studied. This paper reports on the use of the SOLO taxonomy to explore secondary education students ’ representations of the concept of programming variable and the assignment statement. Data was collected in the form of students’ written responses to programming tasks related to short code programs. The responses were mapped to the different levels of the SOLO taxonomy. The results showed that approximately more than one half of the students in the sample tended to manifest prestructural, unistructural and multistructural responses to the research tasks. In addition, the findings provide evidence that students ’ thinking and application patterns are prevalently based on mathematical-like mental models about the concepts of programming variable and the assignment statement. The paper concludes with suggestions for instructional design and practice to help students ’ building coherent and viable mental models of the programming variable and the assignment statement.
Cited by 71
Chunyan Ma, Tong Zhao, Shangru Li et al. · IEEE International Conference on Software Engineering and Service Science (ICSESS) · 2018
The repair of software faults is an important task of software engineering. In this paper, an automated repair framework, called TailorFix is designed and implemented based on abstract syntax tree and repair operators, which is easily expandable by adding different types of repair operators. The TailorFix can be combined with a variety of fault localization technologies. In this paper, we integrate the Delta Debugging technique, as an example, into TailorFix, to achieve a fully automated fault localization and repair for assignment statements of C programs. By classifying faults of assignment statements and designing nine kinds of repair operators, a repair method that applies mutation technology to abstract syntax tree is proposed based on the location information of the Delta Debugging. Finally, experimental subjects of SIR (Software-artifact Infrastructure Repository) are used to verify the effectiveness of the TailorFix. With TailorFix, the average rate is high (on average 85.67%for various types of faults) for assignment statements. The proposed TailorFix framework can achieves more accurate repairs using the corresponding repair operators with respect to abstract syntax tree of different grammar structures, and does not require manual repair patterns, specifications, constraint solving, or search space.
Cited by 0
Wiley eBooks · 2006
This chapter contains sections titled: Combinational versus sequential circuits Simple signal assignment statement Conditional signal assignment statement Selected signal assignment statement Conditional signal assignment statement versus selected signal assignment statement Synthesis guidelines Bibliographic notes
]]>
Cited by 0
Casiano Rodríguez, Francisco de Sande, Coromoto León et al. · Lecture notes in computer science · 1998
Cited by 1Open access
David J. Gries · Lecture notes in computer science · 1979
Cited by 1
J. W. de Bakker · Lecture notes in mathematics · 1971
Cited by 5