Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://en.wikipedia.org/wiki/Unstructured_programming below:

Non-structured programming - Wikipedia

From Wikipedia, the free encyclopedia

Programming paradigm

Non-structured programming is the historically earliest programming paradigm capable of creating Turing-complete algorithms.^{[citation needed]} It is often contrasted with the structured programming paradigm, in particular with the use of unstructured control flow using goto statements or equivalent. The distinction was particularly stressed by the publication of the influential Go To Statement Considered Harmful open letter in 1968 by Dutch computer scientist Edsger W. Dijkstra, who coined the term structured programming.^{[citation needed]}

Unstructured programming has been heavily criticized for producing hardly readable ("spaghetti") code.^{[by whom?]}

There are both high- and low-level programming languages that use non-structured programming. Some languages commonly cited^{[citation needed]} as being non-structured include JOSS, FOCAL, TELCOMP, assembly languages, MS-DOS batch files, and early versions of BASIC, Fortran, COBOL, and MUMPS.

A program in a non-structured language uses unstructured jumps to labels or instruction addresses. The lines are usually numbered or may have labels: this allows the flow of execution to jump to any line in the program. This is in contrast to structured programming which uses sequential constructs of statements, selection (if/then/else) and repetition (while and for).

• BPStruct - A tool to structure concurrent systems (programs, process models)

• v
• t
• e

(

)

• Jackson structures
• Block-structured
• Modular
• Non-structured
• Procedural
• Programming in the large and in the small
• Design by contract
• Invariant-based
• Nested function

• Class-based, Prototype-based, Object-based
• Agent
• Immutable object
• Persistent
• Uniform function call syntax

• Recursive
• Anonymous function (Partial application)
• Higher-order
• Purely functional
• Total
• Strict
• GADTs
• Dependent types
• Functional logic
• Point-free style
• Expression-oriented
• Applicative, Concatenative
• Function-level, Value-level

• Flow-based
• Reactive (Functional reactive)
• Signals
• Streams
• Synchronous

• Abductive logic
• Answer set
• Constraint (Constraint logic)
• Inductive logic
• Nondeterministic
• Ontology
• Probabilistic logic
• Query

• Algebraic modeling
• Array
• Automata-based (Action)
• Command (Spacecraft)
• Differentiable
• End-user
• Grammar-oriented
• Interface description
• Language-oriented
• List comprehension
• Low-code
• Modeling
• Natural language
• Non-English-based
• Page description
• Pipes and filters
• Probabilistic
• Quantum
• Scientific
• Scripting
• Set-theoretic
• Simulation
• Stack-based
• System
• Tactile
• Templating
• Transformation (Graph rewriting, Production, Pattern)
• Visual

• Actor-based
• Automatic mutual exclusion
• Choreographic programming
• Concurrent logic (Concurrent constraint logic)
• Concurrent OO
• Macroprogramming
• Multitier programming
• Organic computing
• Parallel programming models
• Partitioned global address space
• Process-oriented
• Relativistic programming
• Service-oriented
• Structured concurrency

• Attribute-oriented
• Automatic (Inductive)
• Dynamic
• Extensible
• Generic
• Homoiconicity
• Interactive
• Macro (Hygienic)
• Metalinguistic abstraction
• Multi-stage
• Program synthesis (Bayesian, Inferential, by demonstration, by example)
• Reflective
• Self-modifying code
• Symbolic
• Template

• Aspects
• Components
• Data-driven
• Data-oriented
• Event-driven
• Features
• Literate
• Roles
• Subjects

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.3