Unverified50% confidenceFactExact time
A formal grammar is a formalized system in computation theory that describes the rules of language generation; the most classic classification is the Chomsky hierarchy: regular grammars, context-free grammars, context-sensitive grammars, and unrestricted grammars, which respectively correspond to the classes of languages recognizable by finite-state automata, pushdown automata, linear bounded automata, and Turing machines.
1
Sources
50%
Confidence
Long-term
Relevance
11/3/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFormal mathematics refers to rewriting mathematical definitions, theorem statements and proofs into a formal language that a computer can check step by step, with its core being to confirm whether each step of reasoning is valid, rather than to quickly compute results.73% similarUnverified程序化语义将语言映射为可执行的过程（操作序列），而声明式语义将语言映射为逻辑断言或知识图谱三元组72% similarUnverifiedAutoformalization technology uses large language models to convert informal mathematical text into formal representations acceptable to systems such as Lean or Coq70% similarUnverifiedSyntax describes the rules for combining symbols, while semantics concerns the meaning mapping between symbols and the external world; the two are separate levels.69% similarUnverifiedRules are usually declarative constraint entries written by users in natural language or a structured format to specify conditions that must be followed, such as code style, tech stack and review checklists.68% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1129297API
curl https://kongchang.com/api/v1/knowledge/claims/1129297MCP
get_claim(id=1129297)