T F

T F is a language that is made by User:Esolang lover123.

States

States are the building blocks of T F there are only two premade States. they are T and F. [true and false] to define States for A you do States A= [state1 , state2 , state3... , statefinal ] one of the states we can make is boolean! States A= [T,F]. we also have...

Tasks

tasks look something like this:

Task{variables it uses}{task name}[
{code}
]

you can run a task using Do{task name}

Commands

Symbol(s)	function
*X	get input and store it in X
&X	output X
<X and X>	X> will go to <X
X=Y	if X equals Y then skip the next line
X$Y	sets X to Y
!	halts

Programs

NOT GATE

very essential

X=[T,F]
T=[T]
F=[F]
Task{X,T,F}NOT[
*X X=T
X>
Y> 
<X &T
<Y &F
]

OR GATE

A=[T,F]
B=[T,F]
T=[T]
Task{A,B,T}OR[
*A *B A=T
F>
T>
<F &B !
<T &A

AND GATE

Q=[T,F]
A=[T,F]
T=[T]
Task{A,Q,T}AND[
*A *Q A=T
F>
T>
<T &Q !
<F &A !
]

False machine

I=[T,F]
F=[F]
Task{I,F}FalseMachine[
*I I=F
T>
F>
<T &I !
<F &I F>
]?