These languages are typically dynamically typed, meaning that variable declarations and other boilerplate code can be omitted. In these languages, parentheses and other special characters are replaced by prepositions, resulting in quite talkative code. Various attempts to bring elements of natural language grammar into computer programming have produced programming languages such as HyperTalk, Lingo, AppleScript, SQL, Inform, and to some extent Python. Machine compilation of pseudocode style languages Natural language grammar in programming languages Return ∑ k ∈ S x k įor each edge ( u, v) in p do f ( u, v) ← f ( u, v) + c f( p) For example, the sum operator (capital-sigma notation) or the product operator (capital-pi notation) may represent a for-loop and a selection structure in one expression: This is a compact and often informal notation that can be understood by a wide range of mathematically trained people, and is frequently used as a way to describe mathematical algorithms. In numerical computation, pseudocode often consists of mathematical notation, typically from set and matrix theory, mixed with the control structures of a conventional programming language, and perhaps also natural language descriptions. Languages such as HAGGIS bridge the gap between pseudocode and code written in programming languages. Flowcharts, drakon-charts and Unified Modelling Language (UML) charts can be thought of as a graphical alternative to pseudocode, but need more space on paper. Pseudocode resembles skeleton programs, which can be compiled without errors.
No broad standard for pseudocode syntax exists, as a program in pseudocode is not an executable program, however certain limited standards exist (such as for academic assessment). It is commonly used in textbooks and scientific publications to document algorithms and in planning of software and other algorithms. The purpose of using pseudocode is that it is easier for people to understand than conventional programming language code, and that it is an efficient and environment-independent description of the key principles of an algorithm. The programming language is augmented with natural language description details, where convenient, or with compact mathematical notation. It typically omits details that are essential for machine understanding of the algorithm, such as variable declarations and language-specific code. Pseudocode often uses structural conventions of a normal programming language, but is intended for human reading rather than machine reading. In computer science, pseudocode is a plain language description of the steps in an algorithm or another system.
Informal high-level description of the operation of a computer program or other algorithm
0 kommentar(er)
