def Lean.Elab.Term.expandOptPrecedence (stx : Lean.Syntax) : Lean.MacroM (Option Nat)

Expand optional «precedence» where «precedence» := leading_parser " : " >> precedenceParser

structure Lean.Elab.Term.ToParserDescrContext : Type

• catName : Lake.Name
• first : Bool
• leftRec : Bool
• behavior : Lean.Parser.LeadingIdentBehavior

  See comment at Parser.ParserCategory.

@[inline, reducible]

abbrev Lean.Elab.Term.ToParserDescrM (α : Type) : Type

@[inline, reducible]

abbrev Lean.Elab.Term.ToParserDescr : Type

def Lean.Elab.Term.ensureUnaryOutput (x : Lean.Term × Nat) : Lean.Term

def Lean.Elab.Term.addCategoryInfo (ref : Lean.Syntax) (catName : Lake.Name) : Lean.Elab.TermElabM Unit

(Try to) add a term info for the category catName at ref.

def Lean.Elab.Term.addAliasInfo (ref : Lean.Syntax) (info : Lean.Parser.ParserAliasInfo) : Lean.Elab.TermElabM Unit

(Try to) add a term info for the alias with info info at ref.

def Lean.Elab.Term.checkLeftRec (stx : Lean.Syntax) : Lean.Elab.Term.ToParserDescrM Bool

def Lean.Elab.Term.elabParserName? (stx : Lean.Ident) : Lean.Elab.TermElabM (Option Lean.Parser.ParserName)

def Lean.Elab.Term.elabParserName (stx : Lean.Ident) : Lean.Elab.TermElabM Lean.Parser.ParserName

def Lean.Elab.Term.toParserDescr (stx : Lean.Syntax) (catName : Lake.Name) : Lean.Elab.TermElabM (Lean.Term × Option Nat)

Given a stx of category syntax, return a (newStx, lhsPrec?), where newStx is of category term. After elaboration, newStx should have type TrailingParserDescr if lhsPrec?.isSome, and ParserDescr otherwise.

partial def Lean.Elab.Term.toParserDescr.process (stx : Lean.Syntax) : Lean.Elab.Term.ToParserDescr

partial def Lean.Elab.Term.toParserDescr.processSeq (stx : Lean.Syntax) : Lean.Elab.Term.ToParserDescrM (Lean.Term × Nat)

Sequence (aka NullNode)

def Lean.Elab.Term.toParserDescr.ensureNoPrec (stx : Lean.Syntax) : Lean.Elab.Term.ToParserDescrM PUnit

def Lean.Elab.Term.toParserDescr.processParserCategory (stx : Lean.Syntax) : Lean.Elab.Term.ToParserDescrM (Lean.Term × Nat)

partial def Lean.Elab.Term.toParserDescr.processAlias (id : Lean.Syntax) (args : Array Lean.Syntax) : Lean.Elab.Term.ToParserDescrM (Lean.Term × Nat)

partial def Lean.Elab.Term.toParserDescr.processNullaryOrCat (stx : Lean.Syntax) : Lean.Elab.Term.ToParserDescrM (Lean.Term × Nat)

partial def Lean.Elab.Term.toParserDescr.processSepBy (stx : Lean.Syntax) : Lean.Elab.Term.ToParserDescrM (Lean.Term × Nat)

partial def Lean.Elab.Term.toParserDescr.processSepBy1 (stx : Lean.Syntax) : Lean.Elab.Term.ToParserDescrM (Lean.Term × Nat)

def Lean.Elab.Term.toParserDescr.isValidAtom (s : String) : Bool

def Lean.Elab.Term.toParserDescr.processAtom (stx : Lean.Syntax) : Lean.Elab.Term.ToParserDescrM (Lean.Term × Nat)

def Lean.Elab.Term.toParserDescr.processNonReserved (stx : Lean.Syntax) : Lean.Elab.Term.ToParserDescrM (Lean.Term × Nat)

def Lean.Elab.Command.elabDeclareSyntaxCat : Lean.Elab.Command.CommandElab

def Lean.Elab.Command.mkNameFromParserSyntax (catName : Lake.Name) (stx : Lean.Syntax) : Lean.MacroM Lake.Name

Auxiliary function for creating declaration names from parser descriptions. Example: Given

syntax term "+" term : term
syntax "[" sepBy(term, ", ") "]"  : term

It generates the names term_+_ and term[_,]

partial def Lean.Elab.Command.mkNameFromParserSyntax.visit (stx : Lean.Syntax) (acc : String) : String

def Lean.Elab.Command.mkNameFromParserSyntax.appendCatName (catName : Lake.Name) (str : String) : String

def Lean.Elab.Command.resolveSyntaxKind (k : Lake.Name) : Lean.Elab.Command.CommandElabM Lake.Name

def Lean.Elab.Command.isLocalAttrKind (attrKind : Lean.Syntax) : Bool

def Lean.Elab.Command.addMacroScopeIfLocal {m : Type → Type} [Lean.MonadQuotation m] [Monad m] (name : Lake.Name) (attrKind : Lean.Syntax) : m Lake.Name

Add macro scope to name if it does not already have them, and attrKind is local.

def Lean.Elab.Command.elabSyntax : Lean.Elab.Command.CommandElab

def Lean.Elab.Command.elabSyntaxAbbrev : Lean.Elab.Command.CommandElab

def Lean.Elab.Command.checkRuleKind (given : Lean.SyntaxNodeKind) (expected : Lean.SyntaxNodeKind) : Bool

def Lean.Elab.Command.inferMacroRulesAltKind : Lean.TSyntax `Lean.Parser.Term.matchAlt → Lean.Elab.Command.CommandElabM Lean.SyntaxNodeKind

def Lean.Elab.Command.expandNoKindMacroRulesAux (alts : Array (Lean.TSyntax `Lean.Parser.Term.matchAlt)) (cmdName : String) (mkCmd : Option Lake.Name → Array (Lean.TSyntax `Lean.Parser.Term.matchAlt) → Lean.Elab.Command.CommandElabM Lean.Command) : Lean.Elab.Command.CommandElabM Lean.Command

Infer syntax kind k from first pattern, put alternatives of same kind into new macro/elab_rules (kind := k) via mkCmd (some k), leave remaining alternatives (via mkCmd none) to be recursively expanded.

def Lean.Elab.Command.strLitToPattern (stx : Lean.Syntax) : Lean.MacroM Lean.Syntax