A BNF grammar that explains all possible parts of the syntax

UltraInstinct05 · April 18, 2021, 4:55pm

Hi everyone A newbie to the ReScript community.

I was wondering if there is something like a BNF grammar (or maybe something else) that shows/explains/details out all possible parts of the syntax.

For example, the if expressions in the ReScript syntax don’t have to be parenthesized but the compiler behind the online playground compiles such parenthesized if expressions just fine (which I believe is because of a version of ReasonML also being supported).

As another example, what comprises an identifier in ReScript ? I couldn’t find it in the docs (might be my serach fu is a bit off though )

A BNF grammar would help in knowing such details.

Thanks !

craff · December 26, 2022, 3:11am

Yes … where is it ? I really miss it

craff · December 26, 2022, 3:27am

In fact you can find it gathering comment in the parser source (search for ::= ):

github.com

rescript-lang/rescript-compiler/blob/master/res_syntax/src/res_core.ml

module Doc = Res_doc
module Grammar = Res_grammar
module Token = Res_token
module Diagnostics = Res_diagnostics
module CommentTable = Res_comments_table
module ResPrinter = Res_printer
module Scanner = Res_scanner
module Parser = Res_parser

module LoopProgress = struct
  let listRest list =
    match list with
    | [] -> assert false
    | _ :: rest -> rest
end

let mkLoc startLoc endLoc =
  Location.{loc_start = startLoc; loc_end = endLoc; loc_ghost = false}

module Recover = struct

This file has been truncated. show original