no edit summary
No edit summary |
|||
(6 intermediate revisions by 3 users not shown) | |||
Line 1:
{{Unsourced}}[[File:Recursivepronounflag.png|thumb|The recursive pronouns flag.]]
'''Recursive Pronouns''' are a type of [[Pronouns|pronoun]] that add onto themselves with time it is used in a conversation. It can be considered a [[Neopronouns|neopronoun]], however it can also be used solely with non-neopronouns as well. It resets each conversation, so
===History===▼
Recursive Pronouns were originally made and coined by Hal from the Glitched Amethyst System on October 6th 2021 (with Hal also writing this page, and designing the flag).▼
▲=== How To Use ===
Recursive Pronouns are written as ( '''pronoun/set''' [_,_]). The first value indicates the highest it can go, with the second value indicated how many time it is written after passing the limit. The number at the end is pronounced at how you'd write the number, ie; five for (5). If unclear, you can elaborate when asked on what is added on each time (by adding a +___ or ___+ to it to indicate if it goes before or after, but usually assume it goes before)
==
(bit/bitself [3,2]). "Hey, have you talked to '''bit'''?" "'''bitbit''' is pretty cool, you should talk to '''bitbitbit'''!" "Go and grab '''bitbit(4)s''' coat!"
Line 17 ⟶ 12:
([█+] █/█ [2,4]) "I like █! ██ is very nice to me, especially when ████(3) uses my pronouns! I should use ████(4) pronouns more often!
If the
If the
▲=== Advanced Situations That You Will Likely Never Run Into'''™''' ===
▲(Most people with recursive pronouns will never experience this, but here it is for the theoretical situations that may arise.)
▲==== Other Situations ====
▲If the thing to be added has a plus on '''both sides''', then add it to the beginning and end. ([+01+] 01/01self [_,_]) for example.
▲If the thing to be added has a '''minus instead of a plus''', instead remove that character from the pronoun, whichever appears first and/or last (depending on when it appears). If you run out of that letter, don't remove any other letters.
If it has more than one plus or minus, do it that many times.
===
If a <u>max value of a recursive-pronoun set is 0</u>, it is
If a <u>max value of a recursive-pronoun set is -1</u>, it has
===
If a <u>set value of a recursive-pronoun set is 0</u>, after reaching the limit, nothing is added on top of the base. Example: ([+he] she/her [2,0]) would be she => shehe => she(3)
Line 52 ⟶ 45:
Rounding applies seperately for each part of the set. Example: ([+'''🐉'''] dragon/dragonself [0,-0.9] would result in (1) from dragon, but f(2) from dragonself, because it is longer and rounds to 9/10 letters being removed.
▲Recursive Pronouns were originally made and coined by Hal from the Glitched Amethyst System on October 6th 2021
==Flag==
The flag for recursive pronouns was created by Hal from the Glitched Amethyst System. The colors represent masculine and/or feminine pronouns, with yellow representing pronouns that are neither.
[[Category:Pronouns]]
[[Category:Pages Without Resources]]
|