Just another update

This commit is contained in:
Ingy döt Net 2015-02-20 00:35:01 -05:00
parent a25938f123
commit 00a190b0a6
6591 changed files with 94363 additions and 23227 deletions

View file

@ -379,7 +379,7 @@ Multiple regression:
Multiplication tables:
Multiplicative order:
Multisplit:
Mutex:
# Mutex:
Mutual recursion:
N-queens problem:

View file

@ -1,2 +1,19 @@
{{stub}}{{language}}
[[Category:Assembly]]
[[Category:Assembly]]
IBM 360 assembly language.
From Wikipedia, the free encyclopedia.
ASM360, Assembler 360, 360 assembly, or Basic Assembly Language (BAL) are the commonly
used terms for a low-level programming language used on IBM System/360
and successor mainframes.
Originally "Basic Assembly Language" applied only to an extremely restricted
dialect designed to run under control of IBM Basic Programming Support
(BPS/360) on systems with only 8KB of main memory, and only a card reader,
a card punch, and a printer for input/output — thus the word "Basic".
However, the full name and the initialism "BAL" almost immediately attached
themselves in popular use to all assembly-language dialects on the System/360 and
its descendants. The 360 assembly was introduced with the System/360 in 1964.
==Wikipedia article==
http://en.wikipedia.org/wiki/IBM_Basic_assembly_language_and_successors

View file

@ -0,0 +1 @@
../../Task/Conditional-structures/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Empty-program/360-Assembly

1
Lang/360-Assembly/Factorial Symbolic link
View file

@ -0,0 +1 @@
../../Task/Factorial/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Fibonacci-sequence/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Gamma-function/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Integer-comparison/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Loops-Do-while/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Loops-Infinite/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Loops-While/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Lucas-Lehmer-test/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Sieve-of-Eratosthenes/360-Assembly

1
Lang/360-Assembly/Sleep Symbolic link
View file

@ -0,0 +1 @@
../../Task/Sleep/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Sorting-algorithms-Bubble-sort/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Spiral-matrix/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Standard-deviation/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Variable-size-Set/360-Assembly

View file

@ -0,0 +1 @@
../../Task/Even-or-odd/6502-Assembly

1
Lang/ABAP/N-queens-problem Symbolic link
View file

@ -0,0 +1 @@
../../Task/N-queens-problem/ABAP

View file

@ -7,4 +7,5 @@
|gc=yes
|LCT=yes}}
{{language programming paradigm|Functional}}
{{implementation|Lisp}}
ACL2 is both a programming language in which you can model computer systems and a tool to help you prove properties of those models.

1
Lang/ALGOL-60/Comments Symbolic link
View file

@ -0,0 +1 @@
../../Task/Comments/ALGOL-60

1
Lang/ALGOL-60/Empty-program Symbolic link
View file

@ -0,0 +1 @@
../../Task/Empty-program/ALGOL-60

View file

@ -0,0 +1 @@
../../Task/Hello-world-Text/ALGOL-60

1
Lang/ALGOL-60/Loops-For Symbolic link
View file

@ -0,0 +1 @@
../../Task/Loops-For/ALGOL-60

1
Lang/ALGOL-60/Loops-While Symbolic link
View file

@ -0,0 +1 @@
../../Task/Loops-While/ALGOL-60

View file

@ -0,0 +1 @@
../../Task/Sieve-of-Eratosthenes/ALGOL-60

View file

@ -0,0 +1 @@
../../Task/Call-a-function/ALGOL-68

View file

@ -0,0 +1 @@
../../Task/Count-the-coins/ALGOL-68

1
Lang/ALGOL-68/Entropy Symbolic link
View file

@ -0,0 +1 @@
../../Task/Entropy/ALGOL-68

1
Lang/ALGOL-68/Even-or-odd Symbolic link
View file

@ -0,0 +1 @@
../../Task/Even-or-odd/ALGOL-68

View file

@ -0,0 +1 @@
../../Task/Floyds-triangle/ALGOL-68

View file

@ -0,0 +1 @@
../../Task/Function-prototype/ALGOL-68

View file

@ -0,0 +1 @@
../../Task/Guess-the-number-With-feedback/ALGOL-68

1
Lang/ALGOL-68/Knights-tour Symbolic link
View file

@ -0,0 +1 @@
../../Task/Knights-tour/ALGOL-68

1
Lang/ALGOL-68/Mad-Libs Symbolic link
View file

@ -0,0 +1 @@
../../Task/Mad-Libs/ALGOL-68

View file

@ -0,0 +1 @@
../../Task/Middle-three-digits/ALGOL-68

View file

@ -0,0 +1 @@
../../Task/Parsing-RPN-calculator-algorithm/ALGOL-68

View file

@ -0,0 +1 @@
../../Task/Pick-random-element/ALGOL-68

View file

@ -0,0 +1 @@
../../Task/Read-a-specific-line-from-a-file/ALGOL-68

View file

@ -0,0 +1 @@
../../Task/Return-multiple-values/ALGOL-68

View file

@ -0,0 +1 @@
../../Task/Rock-paper-scissors/ALGOL-68

1
Lang/ALGOL-68/Sleep Symbolic link
View file

@ -0,0 +1 @@
../../Task/Sleep/ALGOL-68

View file

@ -0,0 +1 @@
../../Task/Strip-whitespace-from-a-string-Top-and-tail/ALGOL-68

View file

@ -0,0 +1 @@
../../Task/Sum-digits-of-an-integer/ALGOL-68

1
Lang/ALGOL-W/Comments Symbolic link
View file

@ -0,0 +1 @@
../../Task/Comments/ALGOL-W

1
Lang/APL/Fibonacci-sequence Symbolic link
View file

@ -0,0 +1 @@
../../Task/Fibonacci-sequence/APL

View file

@ -0,0 +1 @@
../../Task/Longest-common-subsequence/APL

View file

@ -7,7 +7,7 @@
|strength=strong
|express=explicit
|tags=ATS
|bnf=http://www.ats-lang.org/DOCUMENTATION/GRAMMAR/ats_grammar_desc.html
|bnf=http://ats-lang.sourceforge.net/htdocs-old/DOCUMENT/GRAMMAR/ats_grammar_desc.html
|site=http://www.ats-lang.org/
|hopl=no
}}

1
Lang/ATS/100-doors Symbolic link
View file

@ -0,0 +1 @@
../../Task/100-doors/ATS

1
Lang/ATS/Balanced-ternary Symbolic link
View file

@ -0,0 +1 @@
../../Task/Balanced-ternary/ATS

1
Lang/ATS/Fibonacci-sequence Symbolic link
View file

@ -0,0 +1 @@
../../Task/Fibonacci-sequence/ATS

View file

@ -0,0 +1 @@
../../Task/Greatest-subsequential-sum/ATS

1
Lang/ATS/Hamming-numbers Symbolic link
View file

@ -0,0 +1 @@
../../Task/Hamming-numbers/ATS

1
Lang/ATS/Haversine-formula Symbolic link
View file

@ -0,0 +1 @@
../../Task/Haversine-formula/ATS

View file

@ -0,0 +1 @@
../../Task/Higher-order-functions/ATS

1
Lang/ATS/Identity-matrix Symbolic link
View file

@ -0,0 +1 @@
../../Task/Identity-matrix/ATS

1
Lang/ATS/Repeat-a-string Symbolic link
View file

@ -0,0 +1 @@
../../Task/Repeat-a-string/ATS

1
Lang/ATS/Reverse-a-string Symbolic link
View file

@ -0,0 +1 @@
../../Task/Reverse-a-string/ATS

View file

@ -0,0 +1 @@
../../Task/Roots-of-a-function/ATS

View file

@ -0,0 +1 @@
../../Task/Sierpinski-triangle/ATS

View file

@ -0,0 +1 @@
../../Task/Sum-digits-of-an-integer/ATS

View file

@ -1,20 +1,30 @@
{{language
|exec=interpreted
|tag=awk
}}
}}{{CompileOnline}}
AWK is a small but powerful programming language that can process and convert text files. AWK is part of every [[Unix]]-derived system.
Each AWK program consists of pattern-action statements. The program reads each input line, checks lines against patterns, and runs matching actions. For programs that never read input lines, the entire program can be one <code>BEGIN { ... }</code> block.
Each AWK program consists of pattern-action statements.
The program reads each input line, checks lines against patterns, and runs matching actions.
For programs that never read input lines, the entire program can be one <code>BEGIN { ... }</code> block.
* ''List users who have /bin/ksh as a shell.''<lang awk>$ awk -F: '$7 == "/bin/ksh" { print $1 }' /etc/passwd</lang>
AWK has only three types of variables: they are strings, floating-point numbers, and associative arrays (where every array index is a string). Conversion between strings and numbers is automatic. AWK also has regular expressions, which appear in many AWK programs. There are a few built-in functions, like cos() and sprintf().
AWK has only three types of variables: they are strings, floating-point numbers, and associative arrays (where every array index is a string).
Conversion between strings and numbers is automatic. AWK also has regular expressions, which appear in many AWK programs.
There are a few built-in functions, like cos() and sprintf().
* ''Find average line length.''<lang awk>$ awk '{ cnt += length($0) } END { print cnt / NR }' /etc/rc</lang>
The name "AWK" comes from the initials of Alfred Aho, Peter Weinberger and Brian Kernighan: they invented AWK during the 1970s. A few decades later, Kernighan continues to maintain the [[nawk|reference implementation]] of AWK.
The name "AWK" comes from the initials of Alfred Aho, Peter Weinberger and Brian Kernighan: they invented AWK during the 1970s.
A few decades later, Kernighan continues to maintain the [[nawk|reference implementation]] of AWK.
==Links==
*[http://leaf.dragonflybsd.org/cgi/web-man?command=awk&section=1 awk(1) manual page], short and brief
*[[wp:AWK (programming language)|AWK in Wikipedia]]
*[http://awk.info AWK Community Portal]
*[http://awk.info AWK Community Portal]
==Online-Execution==
* [http://www.compileonline.com/execute_awk_online.php compileonline.com] - gawk 4.1.0 (2013)
* [http://codingground.tutorialspoint.com/ codingground.tutorialspoint.com] - gawk 4.1.0 (2013)
* [http://ideone.com ideone.com] - gawk 3.1.6 (2007), mawk 1.3.3 (Nov 1996)

View file

@ -0,0 +1 @@
../../Task/Anagrams-Deranged-anagrams/AWK

View file

@ -0,0 +1 @@
../../Task/Combinations-with-repetitions/AWK

View file

@ -0,0 +1 @@
../../Task/File-modification-time/AWK

1
Lang/AWK/File-size Symbolic link
View file

@ -0,0 +1 @@
../../Task/File-size/AWK

1
Lang/AWK/Five-weekends Symbolic link
View file

@ -0,0 +1 @@
../../Task/Five-weekends/AWK

View file

@ -0,0 +1 @@
../../Task/Hello-world-Graphical/AWK

1
Lang/AWK/Knights-tour Symbolic link
View file

@ -0,0 +1 @@
../../Task/Knights-tour/AWK

1
Lang/AWK/Langtons-ant Symbolic link
View file

@ -0,0 +1 @@
../../Task/Langtons-ant/AWK

1
Lang/AWK/Modular-inverse Symbolic link
View file

@ -0,0 +1 @@
../../Task/Modular-inverse/AWK

View file

@ -0,0 +1 @@
../../Task/Operator-precedence/AWK

View file

@ -0,0 +1 @@
../../Task/Order-two-numerical-lists/AWK

View file

@ -0,0 +1 @@
../../Task/Sieve-of-Eratosthenes/AWK

1
Lang/AWK/Stem-and-leaf-plot Symbolic link
View file

@ -0,0 +1 @@
../../Task/Stem-and-leaf-plot/AWK

View file

@ -0,0 +1 @@
../../Task/Extend-your-language/Ada

1
Lang/Ada/Set-puzzle Symbolic link
View file

@ -0,0 +1 @@
../../Task/Set-puzzle/Ada

1
Lang/Ada/Visualize-a-tree Symbolic link
View file

@ -0,0 +1 @@
../../Task/Visualize-a-tree/Ada

1
Lang/Aime/Generic-swap Symbolic link
View file

@ -0,0 +1 @@
../../Task/Generic-swap/Aime

View file

@ -0,0 +1 @@
../../Task/Hailstone-sequence/Aime

1
Lang/Aime/String-comparison Symbolic link
View file

@ -0,0 +1 @@
../../Task/String-comparison/Aime

1
Lang/Aime/Sum-of-squares Symbolic link
View file

@ -0,0 +1 @@
../../Task/Sum-of-squares/Aime

View file

@ -0,0 +1 @@
../../Task/Accumulator-factory/AppleScript

View file

@ -0,0 +1 @@
../../Task/Apply-a-callback-to-an-array/AppleScript

View file

@ -0,0 +1 @@
../../Task/First-class-functions/AppleScript

View file

@ -0,0 +1 @@
../../Task/Function-composition/AppleScript

View file

@ -0,0 +1 @@
../../Task/Higher-order-functions/AppleScript

1
Lang/AppleScript/Hostname Symbolic link
View file

@ -0,0 +1 @@
../../Task/Hostname/AppleScript

View file

@ -0,0 +1 @@
../../Task/Loops-Continue/Applesoft-BASIC

View file

@ -0,0 +1 @@
../../Task/Terminal-control-Dimensions/Applesoft-BASIC

View file

@ -0,0 +1 @@
../../Task/Video-display-modes/Applesoft-BASIC

View file

@ -1,7 +1,14 @@
{{language}}{{assembler language}}
[[Category:Encyclopedia]]'''Assembly language''' (or just '''assembly'''; often abbreviated '''asm'''; sometimes called '''assembler''', although that more properly refers to the program that translates the assembly source into machine code) is a term used for a language which is as close to raw machine code as a language can get.
{{language programming paradigm|Imperative}}
[[Category:Encyclopedia]]'''Assembly language''' (or just '''assembly'''; often abbreviated '''asm'''; sometimes called '''assembler''', although that more properly refers to the program that translates the assembly source into machine code) is a term used for a language which is as close to raw machine code as a language can get. Writing in assembly typically requires strict knowledge of the underlying hardware, which lends itself well to implementing [[wp:Firmware|firmware]] due to size and speed constraints.
Usually assembly languages use textual "[[wp:mnemonic|mnemonic]]" instructions that correspond directly to binary machine code instructions (merely hiding details of bit-wise encoding), except for ''macros'' which expand to multiple instructions, and often give direct control over the overall layout of the assembled program on disk and in memory. Available instructions and codes are specific to the architecture being programmed on (although there are assemblers which provide an abstracted, non-architecture-specific language; the most notable one is the [[wp:GNU Assembler|GNU Assembler]]). Assembly programs are typically loaded directly into a computer's memory and run from there.
Assembly languages use textual "[[wp:Mnemonic|mnemonics]]" that correspond directly to machine instructions ([[wp:Opcode|opcodes]]). Writing in assembly often gives direct control over the overall layout of the assembled program on disk and in memory. Available instructions and codes are specific to the architecture being programmed on (although there are assemblers which provide an abstracted, non-architecture-specific language; the most notable of which is the [[wp:GNU Assembler|GNU Assembler]]). Assembly programs are typically loaded directly into a computer's memory and run from there. A software [[wp:Emulator|emulator]] can be used for testing purposes, or in the absence of hardware.
High-level assemblers may include many useful abstractions such as:
* ''macros'' - inline functions which expand to multiple instructions
* generic instructions that match the most appropriate instruction
* optimisations such as rearranging code
* [[:Category:Programming_paradigm/Object-oriented|OOP]] paradigms such as classes and objects
==See also==
*[[wp:Assembly language|Assembly language]] on Wikipedia (includes an in-depth discussion of assembly)

View file

@ -0,0 +1 @@
../../Task/Continued-fraction/AutoHotkey

1
Lang/AutoHotkey/Narcissist Symbolic link
View file

@ -0,0 +1 @@
../../Task/Narcissist/AutoHotkey

View file

@ -0,0 +1 @@
../../Task/Polymorphism/AutoHotkey

View file

@ -0,0 +1 @@
../../Task/Xiaolin-Wus-line-algorithm/AutoHotkey

View file

@ -0,0 +1 @@
../../Task/Numerical-integration-Gauss-Legendre-Quadrature/Axiom

1
Lang/Axiom/Quaternion-type Symbolic link
View file

@ -0,0 +1 @@
../../Task/Quaternion-type/Axiom

View file

@ -11,5 +11,6 @@ BASIC became popular, with many different implementations for various computers.
==Links==
*[[wp:BASIC|Wikipedia:BASIC]]
**[[wp:Rocky Mountain BASIC]]
{{language programming paradigm|Procedural}}

Some files were not shown because too many files have changed in this diff Show more