Linguifex - User contributions [en]

Module:Polola

2026-07-03T08:34:36Z

Nyima:

local p = {}

-- Helper function to trim whitespaces
local function trim(s)
return s:match("^%s*(.-)%s*$")
end

-- Parse function for Polola language grammar and structures
function p.parse(frame)
-- Read 'expr' parameter from template or direct call
local input = frame.args.expr or frame:getParent().args.expr or ""
if trim(input) == "" then
return "Error: No expression provided!"
end

local result = {}

-- Safe tokenization using escaped pattern matching
-- % character escapes operators like +, *, /, and brackets () so they don't cause capture errors
for token in string.gmatch(input, "([^%s%+%*%/]+)") do
-- Clean brackets from the token safely
local clean_token = token:gsub("%(", ""):gsub("%)", "")

-- Separate the base word from numeric quantifiers (e.g., sfg3 -> base: sfg, quantifier: 3)
local base_word, quantifier = clean_token:match("^([a-z]+)(%d*)$")

if base_word then
local meaning = ""
-- Basic Polola vocabulary translation logic
if string.sub(base_word, 1, 1) == "l" then
meaning = "distant/hidden concept (" .. base_word .. ")"
elseif string.sub(base_word, 1, 1) == "s" then
meaning = "present/near concept (" .. base_word .. ")"
else
meaning = "general concept (" .. base_word .. ")"
end

-- Append quantifier info if present
if quantifier and quantifier ~= "" then
meaning = meaning .. " [quantifier: " .. quantifier .. "x]"
end
table.insert(result, meaning)
end
end

-- Check for complex structural operators
local structure_info = ""
if input:match("%(") or input:match("%+") or input:match("%*") or input:match("%/") then
structure_info = " Structure: Complex logical/associative relation detected."
end

-- Return final formatted output
if #result == 0 then
return "Polola syntax: " .. input .. " → Uninterpretable expression."
else
return "Polola syntax: " .. input .. " Interpretation: " .. table.concat(result, ", ") .. structure_info
end
end

return p

Module:Polola

2026-07-03T08:33:00Z

Nyima:

local p = {}

-- Segédfüggvény a szóközök eltávolítására
local function trim(s)
return s:match("^%s*(.-)%s*$")
end

-- A Polola nyelv gyökereinek és nyelvtani elemeinek elemzése
function p.parse(frame)
-- Ha sablonból hívják meg, az 'expr' paramétert olvassa be
local input = frame.args.expr or frame:getParent().args.expr or ""
if trim(input) == "" then
return "Hiba: Nem adtál meg kifejezést!"
end

local result = {}

-- Biztonságos minták (az összetett karakterek % jellel vannak levédve)
-- Így a Lua nem hiszi azt, hogy a zárójel vagy a pluszjel egy belső programozási utasítás
local safe_input = input

-- Itt történik a tokenek feldolgozása sorban
-- A kód végigmegy a bemeneten és elemzi a Polola struktúrát
for token in string.gmatch(safe_input, "([^%s%+%*%/]+)") do
-- Megkeressük a zárójeleket és a speciális Polola karaktereket
local clean_token = token:gsub("%(", ""):gsub("%)", "")

-- Kiszűrjük a számokat (kvantorokat, pl. sfg3 -> 3 darab sfg)
local base_word, quantifier = clean_token:match("^([a-z]+)(%d*)$")

if base_word then
local meaning = ""
-- Egyszerű Polola szótár alapú fordítási logika
if string.sub(base_word, 1, 1) == "l" then
meaning = "távoli/rejtett dolog (" .. base_word .. ")"
elseif string.sub(base_word, 1, 1) == "s" then
meaning = "közeli/jelenlévő dolog (" .. base_word .. ")"
else
meaning = "általános fogalom (" .. base_word .. ")"
end

if quantifier and quantifier ~= "" then
meaning = meaning .. " [" .. quantifier .. "x ismétlődés]"
end
table.insert(result, meaning)
end
end

-- Ha a bemenetben zárójelek vagy operátorok voltak, azt jelezzük a kimeneten a struktúra miatt
local structure_info = ""
if input:match("%(") or input:match("%+") or input:match("%*") then
structure_info = " Struktúra: Összetett logikai/asszociatív kapcsolat észleve."
end

-- Összeállítjuk a végső megjelenítést
if #result == 0 then
return "Polola szintaxis: " .. input .. " → Értelmezhetetlen token."
else
return "Polola szintacia: " .. input .. " Eredmény: " .. table.concat(result, ", ") .. structure_info
end
end

return p

Module:Polola

2026-07-02T18:20:24Z

Nyima: Created page with "local p = {} local deictic = { s = "present / visible / local", l = "distant / hidden / abstract" } local ontology = { d = "object (inanimate matter)", f = "living being (biological entity)", r = "energy (radiation / physical process)", g = "abstract thing (concept / thought)" } local dynamics = { g = "moving / changing / active", h = "stationary / static / at rest" } local operators = { ["+"] = " '''[OR]''' ", ["*"] = " '''[AN..."

local p = {}

local deictic = {
s = "present / visible / local",
l = "distant / hidden / abstract"
}

local ontology = {
d = "object (inanimate matter)",
f = "living being (biological entity)",
r = "energy (radiation / physical process)",
g = "abstract thing (concept / thought)"
}

local dynamics = {
g = "moving / changing / active",
h = "stationary / static / at rest"
}

local operators = {
["+"] = " '''[OR]''' ",
["*"] = " '''[AND]''' ",
["-"] = " '''[NOT / EXCLUDING]:''' ",
["/"] = " '''[IN RELATION TO / DEPENDING ON]:''' ",
["%"] = " '''[SUBSET / REMAINDER OF]:''' ",
["("] = " ( ",
[")"] = " ) ",
[")("] = " '''[XOR / EXCLUSIVE OR]''' ",
["0"] = " '''[FALSE / VOID]''' ",
["1"] = " '''[TRUE / EXISTENCE]''' "
}

local function translate_word(word)
if #word ~= 3 then return word end
local c = string.sub(word, 1, 1)
local o = string.sub(word, 2, 2)
local d = string.sub(word, 3, 3)
if deictic[c] and ontology[o] and dynamics[d] then
return string.format("<%s %s %s>", deictic[c], dynamics[d], ontology[o])
end
return word
end

function p.parse(frame)
local expr = frame.args.expr or frame:getParent().args.expr or ""
if expr == "" then return "''No Polola expression provided!''" end
expr = string.gsub(expr, ")%s*(", " )( ")
for op in string.gmatch("+*-/%()", ".") do
expr = string.gsub(expr, "%" .. op, " " .. op .. " ")
end
local result = {}
for token in string.gmatch(expr, "%S+") do
local word, num = string.match(token, "^([sl][dfrg][gh])(%d+)$")
if word and num then
table.insert(result, string.format("'''%s units of''' %s", num, translate_word(word)))
elseif operators[token] then
table.insert(result, operators[token])
else
table.insert(result, translate_word(token))
end
end
return table.concat(result, "")
end

return p

Poliko

2026-07-02T18:19:58Z

Nyima: Created page with "= Introduction and Core Principles = '''Polola''' is a radically minimalist, engineering, and philosophical language (engilang). Polola completely breaks away from the traditional categories of Indo-European, Uralic, and other natural languages: it features no traditional nouns, verbs, or personal names. The language operates by breaking reality down into '''ontological categories''' and '''dynamic states''', which are tied together by either a proximal or a distal demo..."

= Introduction and Core Principles =
'''Polola''' is a radically minimalist, engineering, and philosophical language (engilang). Polola completely breaks away from the traditional categories of Indo-European, Uralic, and other natural languages: it features no traditional nouns, verbs, or personal names.

The language operates by breaking reality down into '''ontological categories''' and '''dynamic states''', which are tied together by either a proximal or a distal demonstrative core.

= Core Elements (Morphemes) =
Polola constructs every single concept in the universe using combinations of just a few foundational characters.

== The Demonstrative Cores (Deictic Anchors) ==
The language distinguishes two types of focus relative to the speaker:
* '''s''': Proximal demonstrative. Meaning: "This thing here", "The present/visible entity".
* '''l''': Distal or abstract demonstrative. Meaning: "That thing there", "The distant/hidden entity", "The entity we are thinking about".

== Forms of Existence (Ontological Classifiers) ==
The character immediately following the demonstrative core determines the material or abstract nature of existence:
* '''d''': Object / Inanimate physical matter.
* '''f''': Living being / Biological existence.
* '''r''': Energy / Radiation / Physical process.
* '''g''': Abstract thing / Thought / Conceptual entity.

== Dynamics and Change (State Modifiers) ==
The character at the end of the word expresses the current dynamic state of the entity:
* '''g''': Motion / Change / Active process (moving).
* '''h''': State / Stasis / Rest (stationary).

= The Grammatical Matrix =
Word formation follows a strict mathematical logic: '''Demonstrative Core (s / l) + Form of Existence + Dynamics'''.

{| class="wikitable" style="margin: 1em auto 1em auto;"
|+ The Combinatorial Matrix of Polola
! Form of Existence !! Proximal Motion (-g) !! Proximal Stasis (-h) !! Distal Motion (-g) !! Distal Stasis (-h)
|-

| '''Object (-d-)''' || <tt>sdg</tt> || <tt>sdh</tt> || <tt>ldg</tt> || <tt>ldh</tt>
|-

| '''Living Being (-f-)''' || <tt>sfg</tt> || <tt>sfh</tt> || <tt>lfg</tt> || <tt>lfh</tt>
|-

| '''Energy (-r-)''' || <tt>srg</tt> || <tt>srh</tt> || <tt>lrg</tt> || <tt>lrh</tt>
|-

| '''Abstract (-g-)''' || <tt>sgg</tt> || <tt>sgh</tt> || <tt>lgg</tt> || <tt>lgh</tt>
|}

= Boolean Algebra and Mathematical Extension =
Polola integrates Boolean algebra, numeric constants, and mathematical operators directly into its syntax to chain complex logical relations.

== Logical and Arithmetic Operators ==
{| class="wikitable" style="width: 100%;"
! Operator !! Logical / Mathematical Function !! Meaning in Polola Context
|-

| <tt>'''*'''</tt> || AND (Conjunction) || Coexistence or intersection of traits/entities.
|-

| <tt>'''+'''</tt> || OR (Disjunction) || Union of sets or alternative entities.
|-

| <tt>'''-'''</tt> || NOT / Subtraction || Negation or strict exclusion from the context.
|-

| <tt>'''()'''</tt> || Parentheses || Defines operation precedence and grouping.
|-

| <tt>''') ('''</tt> || XOR (Exclusive OR) || Absolute alternative (either one or the other, not both).
|-

| <tt>'''/'''</tt> || Division / Relation || Dependency, proportion, or location within an entity.
|-

| <tt>'''%'''</tt> || Modulo / Remainder || Subset, fractional component, or remainder of an entity.
|-

| <tt>'''0'''</tt> || False / Null State || Void, non-existence, or false logical value.
|-

| <tt>'''1'''</tt> || True / Identity State || Presence, existence, or true logical value.
|}

== Numeric Quantifiers ==
Numbers are appended directly to any 3-character morpheme to define exact quantities (e.g., <tt>sfg3</tt> represents three distinct proximal moving living beings).

== Automated Parse Examples ==
* '''Complex Syntax:''' <tt>(sfg * lrg) / ldh</tt> → {{#invoke:Polola|parse|expr=(sfg * lrg) / ldh}}
* '''Quantifier Logic:''' <tt>sfg3 + sdh - lgg</tt> → {{#invoke:Polola|parse|expr=sfg3 + sdh - lgg}}

= Association and Guessing Function =
Because words starting with the letter <tt>l</tt> refer to things that are not present (hidden or distant), Polola is inherently suited for conceptual association games and riddles.

'''Associative Riddle Example:'''
If someone says: <tt>lfg + lrh</tt>
* Meaning: "That distant living being which is moving (<tt>lfg</tt>) AND/OR that distant energy which is at rest (<tt>lrh</tt>)."
* Dynamic System Translation: {{#invoke:Polola|parse|expr=lfg + lrh}}
* The audience must guess the context based on the clue (e.g., a bear sleeping in a distant cave, or a far-off storm cloud hiding static electricity).

'''Guessing Example:'''
* <tt>ldh</tt> – "A distant, stationary object." This could be a buried treasure, a table in another room, or an abandoned house on a mountain. The speaker can chain additional codes to narrow down the association.

[[Category:A priori conlangs]]
[[Category:Engineered languages]]

Pololo

2026-06-30T17:42:25Z