The article explores the evolution of compilers, focusing on the shift from traditional pipeline architectures to query-based models, particularly in the context of Language Server Protocols (LSPs). Traditional compilers operate as a linear sequence of transformations, converting source code into a binary through stages like parsing into an Abstract Syntax Tree (AST) and generating Intermediate Representation (IR). This process can be time-consuming, making it impractical for real-time interactions as developers type. Query-based compilers represent a more interactive approach. Instead of processing all code through a rigid pipeline, they respond to specific queries. For instance, when a developer types in an editor, the LSP sends queries to the compiler to fetch suggestions or definitions related to the current cursor position. This method allows the compiler to focus on only the relevant parts of the code, avoiding unnecessary processing of unrelated files. Key components of query-based compilers include queries, inputs, and a database. Queries function like functions that require a database and input argument, facilitating efficient data retrieval. Inputs act as stateful objects that notify the compiler when files change, prompting updates to the cache. Unlike signals in UI programming, where changes trigger automatic updates, queries require explicit execution. This distinction is significant: it allows for controlled interactions in a coding environment, enhancing performance and responsiveness without the overhead of constant re-evaluation.