Éšœłãñg

Éšœłãñg is an esolang based around how User:Yayimhere(the creator)'s keyboard produces diacritics

semantics(Éšœłãñg Normal)

so there is a base string(top line of program) and then theres rules, both defined within the program. in each rule, you have a single character X, and a number N. on different cycles of the program this rule will be interpreted differently. below are these interpretations:

• odd cycles: on odd cycles all instances of X in the base string is replaced with the N'th diacretic(see odd rules section). if N is too high, the rule is ignored.
• even cycles: replace all instances of X in the string with X repeated N times
• prime even cycles: apply the prime cycle then the even one.
• prime odd cycles: apply prime cycle then odd cycle
• where the prime cycle(though never run) will replace all instances of X in the string with the base string every time Xis placed at an index that is a multiple of N

index'es start at 0.

Comp class

Éšœłãñg looks like it must be sub TC, because of the fact every rule is neighbor-independent. however because of prime rules, it technically is not, as the whole string is a part of a specific characters neighborhood, and as such on prime cycles it is neighborhood dependent.

syntax

so the syntax is for every line:

x:y

the x is the char that is replaced with things and y is the number. having \e will act as the empty string and adding a [ in front of a char will escape it.

odd rules

e and 1, 2 -> é, ë
y and 1, 2 -> ý, ÿ
u and 1, 3, 4, 5 -> ú, ü, û, ù, ū
i and 1, 2 -> í, ï
o and 7 -> ó, ô, ò, õ, œ, ō, ö
a and 1, 2, 3, 4, 5, 6 -> á, ä, à, â, ã, ā
s and 1,2,3 -> ß, ś, š
d and 1 -> ð
l and 1 -> ł
n and 1, 2 -> ñ, ń