• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
      • Legacy-defrstobj
      • Proof-checker-array
      • Soft
      • C
      • Farray
      • Rp-rewriter
      • Instant-runoff-voting
      • Imp-language
      • Sidekick
      • Leftist-trees
      • Java
      • Riscv
      • Taspi
      • Bitcoin
      • Des
      • Ethereum
      • X86isa
      • Sha-2
      • Yul
      • Zcash
      • Proof-checker-itp13
      • Regex
      • ACL2-programming-language
      • Json
      • Jfkr
      • Equational
      • Cryptography
      • Poseidon
      • Where-do-i-place-my-book
      • Axe
      • Aleo
        • Aleobft
        • Aleovm
        • Leo
          • Grammar
          • Early-version
            • Json2ast
            • Testing
            • Definition
              • Flattening
              • Abstract-syntax
              • Dynamic-semantics
              • Compilation
              • Static-semantics
              • Concrete-syntax
                • Pretty-printer
                • Grammar
                • Lexing-and-parsing
                • Input-pretty-printer
                • Output-pretty-printer
                • Unicode-characters
                • Concrete-syntax-trees
                • Symbols
                • Keywords
      • Bigmems
      • Builtins
      • Execloader
      • Solidity
      • Paco
      • Concurrent-programs
      • Bls12-377-curves
    • Debugging
    • Community
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
    • Math
    • Testing-utilities
  • Definition

Concrete-syntax

Concrete syntax of Leo.

The concrete syntax of Leo defines which Unicode character sequences form syntactically valid Leo code and related artifacts, and how such sequences are organized into constructs.

The concrete syntax of Leo is formalized via ABNF grammar rules, complemented by a declarative specification of lexing and parsing that uses and disambiguates the grammar rules.

Subtopics

Pretty-printer
A pretty-printer for Leo (code) files.
Grammar
ABNF grammar of Leo.
Lexing-and-parsing
Lexing and parsing of Leo.
Input-pretty-printer
A pretty-printer for Leo input files.
Output-pretty-printer
A pretty-printer for Leo output files.
Unicode-characters
Unicode characters.
Concrete-syntax-trees
Concrete syntax trees (CSTs).
Symbols
Leo symbols.
Keywords
Leo keywords.