Draft:Pinakanakakapagngitngitngitngitang-pakikipagsinungasinungalingan

Pinakanakakapagngitngitngitngitang-pakikipagsinungasinungalingan is an esoteric programming language by User:AnalysisOfVariance in 2026.

This language has 48 categories, shattering Categorial's 34 and surpassing ™'s 40!

Etymology

The name is a very long, if not the longest word in the Tagalog language. It is derived from "pinakanakakapagngitngitngitngitang-pagsisinungasinungalingan" which roughly means "lying that causes the most extreme anger" and is commonly cited as the longest Tagalog word; it is derived from "ngitngit" roughly meaning rage, the prefix "pinaka-" meaning "the most", and "pagsinungalingan" meaning "to lie". It (the language) is not however, related to the VOCALOID song "PINAKANAKAKAPAGNGITNGITNGITANGPAGSISINUNGASINUNGALINGAN".

Overview

The language is a compiled language. It functions in a similar manner to TMMLPTEALPAITAFNFAL in the sense that it changes based on the date the program is compiled. Based on the date that the compiler is run, the following components of the language are decided:

• Base
• Syntax
• Syntactical modifications
• Base command set
• Command assignment

Bases

Pinakanakakapagngitngitngitngitang-pakikipagsinungasinungalingan utilizes bases to determine the fundamental semantics of the language to be compiled. See them at Draft:Pinakanakakapagngitngitngitngitang-pakikipagsinungasinungalingan/Bases.

Syntaxes

Bases that ignore or do not do anything meaningful with their source code such as Nope. derivative and Nope. without a quine derivative can have any style assigned to them, or even the null style which means anything goes. Some styles can be combined, for example C-style and UwU/Kawaii.

BASIC

The syntax is in a similar manner to that of BASIC, FORTRAN, or worse yet COBOL. This is compatible with Lambda calculus, Non-esoteric, String-rewriting machine, and Turing machine. The keywords are all uppercase by default, but another style may modify that.

Below is the base set of keywords:

ASYNC
BEGIN
CLASS CONST CONSTANT
DELETE
ELIF ELSE END
FOR FROM
GOSUB GOTO
IF IN INT INTEGER
LET
NEW
PROC PROCEDURE
REAL RET RETURN
TO
VAR VARIABLE

Brackets

The characters available are <>()[]{}. By default, they must be matched but do not have to be properly nested, so for example [(]) is legal. It is compatible with all bases.

brainfuck impostor

This syntax utilizes brainfuck's 8 commands. It is compatible with Turing machine, String-rewriting machine, Fungeoid, and Lambda calculus.

C-style

Blocks are delimited by curly braces {}. This is compatible with Lambda calculus, Non-esoteric, and Turing machine.

The base keyword set is:

async auto await
class const
delete double
f32 f64 float fun func function
elif else
i8 i16 i24 i32 i40 i48 i56 i64 i128 if int
let long
new
return
unsigned
var

Combinatory

This syntax uses common combinatory logic combinators such as those from the SKI basis, BKCW basis, the incomplete IJ basis, and the universal combinator U. It is compatible with Lambda calculus only.

LOLcat

This syntax is similar to that of LOLCODE. This is combined with either Pythonic or C-style.

Pythonic

Blocks are delimited by : and indentation. This is compatible with Lambda calculus, Non-esoteric, and Turing machine.

sed

This syntax utilizes s/A/B. It is compatible with Lambda calculus and String-rewriting machine.

Steganography (image)

The program is stored in an image file. It works with all bases.

Stereotypical Gen ZAlpha slang

Self-explanatory. It is compatible with Turing machine, String-rewriting machine, Lambda calculus, and Non-esoteric.

Unlambda combinatory

This is a variant of combinatory using Unlambda's prefix notation.

UwU/Kawaii

This syntax is UwU. This can either be standalone or mixed with BASIC, C-style, LOLcat, or Pythonic.

When mixed with the BASIC style, all keywords become lowercase.

な

Instructions are simply encoded with repeated strings of なs terminated by either 。, 、, ！, ？, or ～. The specific encoding scheme is decided later. This style is compatible with all bases.

Syntactical modifications

None

Self-explanatory.

Brackets

Proper nesting

Brackets must be properly nested. For example, [(]) would no longer be legal.

Combinatory and Unlambda combinatory

BKCW

Only the BKCW combinators can be used.

Crazy J

Only the IJ combinators can be used.

SKI

Only SKI combinators can be used.

U

Only the universal combinator can be used.

Steganography (image)

Greyscale

The program's image must have the RGB channels of each pixel be equal.

Sepia filter

The program's image must be tinted yellow.

Stereotypical Gen ZAlpha slang

SIIIIIIIIIIIIIIIIX SEEEEEEEEEEVEEEEEEEEEEEEEEEEEEN!!!!!!!!!!!!!!!

67, 6-7, sixseven, six seven, and SIX SEVEN must all together be 67% of the program's words.

Stereotypical Gen Alpha slang

Only stereotypical Gen Alpha slang can be used. Stereotypical Gen Z slang that isn't associated with Gen Alpha is forbidden.

Stereotypical Gen Z slang

Only stereotypical Gen Z slang can be used. Stereotypical Gen Alpha slang is forbidden, including 67.

UwU/Kawaii

Notice me senpai

The word "senpai" must be 20% of all of the words in the program.

Stuttering anime girl

40% of the program's stutterable words must be stuttered.

uwu

5% of the program's words must be "uwu". (not "UwU")

な

nyanyanyanyanyanyanyanyanyanyanyanyanyanyanyanya

"な" is replaced with "にゃ".

Encodings

The encoding can either be:

• Unary ASCII/UTF-8 (default)
• Unary UTF-32
• Unary Shift-JIS
• Unary GB 18030
• Unary EBCDIC
• Unspecified (specific to the base)

Base command sets

One command set that is compatible with the current base is selected and a random subset of commands are selected from it. The commands pictured here are merely pseudo-representations as they are not assigned until a command assignment has been assigned.

Fungeoid

UP goes up.

DOWN goes down.

LEFT goes left.

RIGHT goes right.

VERTIF is a vertical IF. If the predicate is truthy, then the IP goes up. Otherwise, it goes down.

HORIZIF is a horizontal IF. If the predicate is true, then the IP goes right. Otherwise, it goes left.

REFLECT reflects the IP's delta.

SKIP skips the next instruction.

HALT halts the IP.

Lambda calculus

Combinators.

Non-esoteric

The Non-esoteric base does not have a specific "command set"; instead one or more paradigms are selected to create the final language.

The paradigms that can be selected are:

• Array
• Concurrent
  • Actor
• Declarative
  • Functional
• Event-based
• Generic
• Imperative
• Multiple dispatch
• Object-oriented
  • Class-based
  • Object-based
  • Prototype-based
• Procedural
• Reflective

Turing machine

LEFT moves the tape head to the left.

RIGHT moves the tape head to the right.

INPUT reads user input into the tape head.

OUTPUT outputs the cell at the tape head.

Computational class

Pinakanakakapagngitngitngitngitang-pakikipagsinungasinungalingan has no set computational class since it can change wildly from one day to another, however its computational class overall varies from sub-combinational logic to Turing-complete as the Nope. derivative and Nope. without a quine derivative bases are fairly trivial while the Cellular automaton, Fungeoid, Lambda calculus, Non-esoteric, String-rewriting machine, and Turing machine bases are Turing-complete, provided there are no restrictions that would make them sub-Turing-complete.

Examples

Cat program

This one uses the Turing machine base and the brainfuck impostor style with a self-explanatory command set. Surprisingly, it is also a polyglot with brainfuck.

,[.,]

UwUfier

This uses the String-rewriting machine base and the BASIC + UwU/Kawaii syntax.

pwease w-wepwace "l" with "w" uwu~
p-pwease wepwace "r" with "w" uwu~

See also

• TMMLPTEALPAITAFNFAL