Category:11l
11l
This programming language may be used to instruct a computer to perform a task.
Listed below are all of the tasks on Rosetta Code which have been solved using 11l.
This programming language may be used to instruct a computer to perform a task.
Official website |
---|
Execution method: | Compiled (machine code) |
---|---|
Garbage collected: | No |
Parameter passing methods: | By reference, By value |
Type strength: | Strong |
Type checking: | Static |
Lang tag(s): | 11l |
See Also: |
|
11l (elevenel) is a [semi-esoteric] high-level general-purpose programming language, which provides a simple and direct mapping to hardware and aims to follow a zero-overhead principle, like C++. 11l is statically typed, but feels very much like a dynamically typed language (e.g. Python).
The design of 11l is aimed to achieve as much conciseness as possible.
The evident distinction of 11l from all other existing programming languages is its keywords are organized in a tree, not just a list.
There are 11 keywords at the root of that tree, and each word can be written as one letter:
C, I, E, F, L, N, R, S, T, V, X.
Pages in category "11l"
The following 200 pages are in this category, out of 1,016 total.
(previous page) (next page)N
O
- Odd and square numbers
- Odd squarefree semiprimes
- Odd words
- Old lady swallowed a fly
- Old Russian measure of length
- One of n lines in a file
- One-dimensional cellular automata
- OpenWebNet password
- Operator precedence
- Orbital elements
- Order by pair comparisons
- Order disjoint list items
- Order two numerical lists
- Ordered partitions
- Ordered words
- Own digits power sum
P
- Padovan n-step number sequences
- Padovan sequence
- Palindrome dates
- Palindrome detection
- Palindromic primes
- Palindromic primes in base 16
- Pangram checker
- Paraffins
- Parsing/RPN calculator algorithm
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Partial function application
- Partition an integer x into n primes
- Partition function P
- Pascal matrix generation
- Pascal's triangle
- Pascal's triangle/Puzzle
- Peaceful chess queen armies
- Pell's equation
- Penney's game
- Penrose tiling
- Pentomino tiling
- Perceptron
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect numbers
- Perfect shuffle
- Perfect totient numbers
- Periodic table
- Perlin noise
- Permutation test
- Permutations
- Permutations by swapping
- Permutations with repetitions
- Permutations with some identical elements
- Permutations/Derangements
- Permutations/Rank of a permutation
- Pernicious numbers
- Phrase reversals
- Pi
- Pick random element
- Pig the dice game
- Piprimes
- Pisano period
- Playfair cipher
- Poker hand analyser
- Polynomial long division
- Polynomial regression
- Polynomial synthetic division
- Population count
- Positive decimal integers with the digit 1 occurring exactly twice
- Power set
- Powerful numbers
- Practical numbers
- Price fraction
- Price list behind API
- Primality by trial division
- Primality by Wilson's theorem
- Prime conspiracy
- Prime decomposition
- Prime numbers which contain 123
- Prime triplets
- Prime words
- Primes - allocate descendants to their ancestors
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Primorial numbers
- Print itself
- Priority queue
- Problem of Apollonius
- Product of divisors
- Product of min and max prime factors
- Program name
- Program termination
- Proper divisors
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/Middle-square method
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Splitmix64
- Pseudo-random numbers/Xorshift star
- Pythagorean quadruples
- Pythagorean triples
R
- Railway circuit
- Ramer-Douglas-Peucker line simplification
- Ramsey's theorem
- Random Latin squares
- Random number generator (included)
- Range consolidation
- Range expansion
- Range extraction
- Range modifications
- Ranking methods
- Ray-casting algorithm
- Read a configuration file
- Read a specific line from a file
- Read entire file
- Readline interface
- Real constants and functions
- Recaman's sequence
- Reduced row echelon form
- Regular expressions
- Remove duplicate elements
- Remove lines from a file
- Remove vowels from a string
- Rename a file
- Rep-string
- Repeat
- Repeat a string
- Resistance calculator
- Resistance network calculator
- Resistor mesh
- Return multiple values
- Reverse a string
- Reverse the gender of a string
- Reverse the order of lines in a text file while preserving the contents of each line
- Reverse words in a string
- Riordan numbers
- Rock-paper-scissors
- Roman numerals/Decode
- Roman numerals/Encode
- Roots of a function
- Roots of a quadratic function
- Roots of unity
- Rosetta Code/Fix code tags
- Rot-13
- RPG attributes generator
- RSA code
- Run-length encoding
- Runge-Kutta method
S
- S-expressions
- Safe and Sophie Germain primes
- Sailors, coconuts and a monkey problem
- Sattolo cycle
- Scope modifiers
- Search a list
- Search a list of records
- Search in paragraph's text
- SEDOLs
- Selectively replace multiple instances of a character within a string
- Self-describing numbers
- Semiprime
- Semordnilap
- Separate the house number from the street name
- Sequence of non-squares
- Sequence of primes by trial division
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Set
- Set right-adjacent bits
- Seven-sided dice from five-sided dice
- Sexy primes
- Shell one-liner
- Shift list elements to left by 3
- Shoelace formula for polygonal area
- Short-circuit evaluation
- Shortest common supersequence
- Show ASCII table
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Sierpinski arrowhead curve
- Sierpinski carpet
- Sierpinski curve
- Sierpinski square curve
- Sierpinski triangle
- Sieve of Eratosthenes
- Simple database
- Sleep
- Sleeping Beauty problem
- Smallest enclosing circle problem
- Smallest multiple
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Smarandache prime-digital sequence
- Smith numbers
- Snake and ladder