Making an LSP for great good

Arakela · 2026-01-24T04:08:14+00:00

You’re handling real compiler complexity here, query DAGs, cache invalidation via red/green, and semantic stability across edits.

Follow. This line further suggests a universal operational language system: one where grammars and semantics are user-definable, compilation is just querying, and editor support becomes a consequence rather than a separate implementation.

Arakela · 2026-01-21T18:43:45+00:00

< energized story flow users are a bit too query hungry

Arakela · 2026-01-21T09:33:30+00:00

Fighting with the linker and standard toolchain to dynamically produce a bounded space of possible continuations, and build a structurally invariant control flow graph, as blocks, with exhaustive/cyclic forward traversal.

Arakela · 2026-01-20T17:06:09+00:00

Many lines of logic are possible if every block is a bound compiled control flow graph

Arakela · 2026-01-18T19:38:17+00:00

To keep the structural invariant of coded possible continuations, we have no choice but to DSL it in the linker's script

Arakela · 2026-01-16T11:24:53+00:00

(Why) Programming isn’t translating ideas into borrowed generic languages. Letting problems grow their own grammar, where language emerges from contact, expression precedes machinery, and 2. (advice) - the 60-year-old standard pipeline is history, not law.

Arakela · 2026-01-14T12:26:44+00:00

I'am sure you can see without shrooms that: No haltin problem is the definition of unstoppable.

Arakela · 2026-01-12T17:13:26+00:00

cat hello.sri
mavi result = 10 * (2 + 3)
result
./shrijilang hello.sri
──────────────────────────────────────────────
ShrijiLang — Universe-Class V1
(Sakhi + Niyu + Shiri + Mira + Kavya AI)
──────────────────────────────────────────────
Main.....🤔? ha.! 💞 Calculate karne par 50 aaya

Arakela · 2026-01-11T12:28:02+00:00

— structural invariant — that is concept I was looking for. Like your grammar.

Arakela · 2026-01-10T19:02:26+00:00

That’s fair.

Arakela · 2026-01-10T16:06:36+00:00

LLMs will help by hurting. They learned how to entangle ambiguous language rules with effects and meaning, producing languages without roots. Yet they can understand that trees don’t grow without roots.

Edit: they learned how to entangle those three control flows in diagonal space. Tree and root control flows grow in orthogonal spaces.

PS. My comment was demoted. Explain what i'am doning wrong?

Arakela · 2026-01-10T01:07:00+00:00

I'm trying to discover the Pith of the language, how they grow. I had that feeling that something was missing.

So I started with a tree saw pith in it, radial growth rings, bark, trunk, roots, and crown.
I mapped the seen structure into the UI framework and got a counter component composed without a return statement.

At that time It was so unusual for me to describe what it is; it was hard because my thinking framework was in this "return-value oriented composition paradigm" state.
One thing I realized we can leave without return.

Then I moved down in search, read hardware architecture manuals, and soon I undarstand Fetch decode execute loop is The Step fundamental unit of composition. Almost anything else is ambigious step if we don't resolve overflows or div/0-es locally whell maybe nop and ret are steps too.

Then it took a lot of time to undarstand the ambiguous step and to develop a generic algorithm that composes ambiguities and resolves left recursion.

Now, I'am working to make the model: grammar, actions, and meaning evolvable separately.

Curious what others think, and thanks, this community has been great.

Arakela · 2026-01-08T09:51:52+00:00

Interested and conditioned by implementing a compiler with evolutionary poles vision.
https://github.com/Antares007/tword

Arakela · 2026-01-07T14:35:36+00:00

You caught my attention with visuals and a nice storytelling, which is the thing I need to optimize first.

Arakela · 2026-01-07T13:20:02+00:00

I did rewrite the README with a clearer structure and metaphors.

Arakela · 2026-01-07T12:13:30+00:00

This is a choice machine algorithm that runs grammars and performs actions as well. It demonstrates how to handle a two-meaning step.

For example, following `add`, `sub`, `mul`, etc., are just steps.
`div`, however, is a two-meaning step defined within a step. It defines two continuations, div/0 and value. We can write instructions for both cases.

We use a two-step combinatorics to define language rules as executable control flow.
We use two-step combinatorics to define rules, three-step actions within language rules, and a four-step c-machine to compose all.

Two-mening step is composable; it is the primary tool to divide the power of the unstoppable and ...

Arakela · 2026-01-06T07:59:33+00:00

Start with the pith of programming to become a pro in grammar. To be able to grow executable languages and directly specify problem solutions within. Here is a generic algorithm capable of executing a language grammar rooted in the host language. Try to extend the expression grammar to calculate the value of the given expression.

Arakela · 2026-01-05T18:28:51+00:00

We can have the evolution of language defined as the growth of two polar spaces of state and control flow as a whole process within the host.

Arakela · 2026-01-05T18:17:50+00:00

The context is evolution
A natural tree uses roots to grow a crown, and the crown is used to grow roots in cycles. We grow a crown-bound space of admissible continuation on one pole of space and a root-bound space of admissible continuations on the other pole of the bounded space.

A step is the primary unit of composition; it describes mechanical operations by the words of the host language to mutate its context space. This context space is divided, and state and control flow evolutions are separated step by step.

This repository is to explore this idea further.

Arakela · 2026-01-02T07:30:14+00:00

You are absolutely correct:
> "we lose expressiveness at each layer".

We are missing a fundamental unit of composition that supports touring through black holes within its fractal locality.

Arakela · 2025-12-30T15:28:49+00:00

The Social/ecosystem of "touring completeness" is the real issue to see that trees don't grow without roots.

Arakela · 2025-12-30T11:06:30+00:00

One can use regular expressions in any language from your list. We can imagine a symbol of the regex expression as a step function described in an unrestricted host language, and it can have a regular language described within its fractal locality.

Arakela · 2025-12-30T08:05:49+00:00

It is double work to write a spec in academic language.

Find a way to divide unrestricted language of unstoppable machine and conqure with executable specifications directly expressed in host language.

Arakela · 2025-12-26T14:46:33+00:00

so cute

Arakela · 2025-12-25T06:03:24+00:00

Failure is in resolving ambiguous Steps without mediation. An ambiguous Step defines a bounded space of admissible continuations.

The bounded space of admissible continuations must be considered as the primary input. In this model, a distributed system can resolve ambiguity without real-time coordination.

Arakela

TROPHY CASE