1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648
|
(*
Original Poly version:
Title: Lexical Analyser.
Author: Dave Matthews, Cambridge University Computer Laboratory
Copyright Cambridge University 1985
ML translation and other changes:
Copyright (c) 2000
Cambridge University Technical Services Limited
Further development:
Copyright (c) 2000-7, 2015 David C.J. Matthews
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License version 2.1 as published by the Free Software Foundation.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*)
functor LEX_ (
structure PRETTY: PRETTYSIG
structure SYMBOLS : SymbolsSig
structure DEBUG: DEBUGSIG
) : LEXSIG =
(*****************************************************************************)
(* LEX functor body *)
(*****************************************************************************)
struct
open Misc;
open PRETTY;
open SYMBOLS; infix 8 eq neq;
type location = { file: string, startLine: int, startPosition: int, endLine: int, endPosition: int }
type lexan =
{
stream: unit -> char option,
ch: char ref,
sy: sys ref,
id: string ref,
messageOut:
{ location: location, hard: bool, message: pretty, context: pretty option } -> unit,
errors: bool ref,
pushedSym: sys ref,
extraChars: char list ref,
debugParams: Universal.universal list,
(* Location information. *)
getLineNo: unit -> int,
getOffset: unit -> int,
fileName: string,
startLine: int ref,
endLine: int ref,
startPosition: int ref,
endPosition: int ref,
bindingCounter: unit -> int
};
(* The lexical analyser reads characters from the stream and updates the
references in the lexan structure. That's not perhaps very ML-like
but the lexical analyser can be a hot-spot in the compiler unless it's
made as fast as possible. *)
val eofChar = Char.chr 4; (* ctrl/D *)
val isNumeric = Char.isDigit
and isAlphabetic = Char.isAlpha
and isWhiteSpace = Char.isSpace
and isHexadecimal = Char.isHexDigit
(* For our purposes we include quote and underscore. *)
fun isAlphaNumeric c = Char.isAlphaNum c orelse c = #"'" orelse c = #"_"
(* Print error and warning messages. *)
val errorMessageProcTag:
({ location: location, hard: bool, message: pretty, context: pretty option } -> unit)
Universal.tag =
Universal.tag()
val isOperator = Char.contains ":=<>+*!^/|&%~-?`@\\$#";
(* The initial state looks like we've just processed a complete ML declaration *)
fun initial (stream, parameters) : lexan =
let
open DEBUG
val errorMessageProc =
case List.find (Universal.tagIs errorMessageProcTag) parameters of
SOME f => Universal.tagProject errorMessageProcTag f
| NONE => fn _ => raise Fail "Error in source code"
val lineno = getParameter lineNumberTag parameters
val offset = getParameter offsetTag parameters
val filename = getParameter fileNameTag parameters
val initialLine = lineno() (* Before the first char. *)
and initialOffset = offset()
val bindingCounter = getParameter bindingCounterTag parameters
in
{
stream = stream,
ch = ref #" ", (* " " - we've just "clobbered the ";" *)
sy = ref Semicolon, (* ";" *)
id = ref "",
messageOut = errorMessageProc,
errors = ref false,
pushedSym = ref Othersy,
extraChars = ref [],
debugParams = parameters,
getLineNo = lineno,
getOffset = offset,
fileName = filename,
startLine = ref initialLine,
endLine = ref initialLine,
startPosition = ref initialOffset,
endPosition = ref initialOffset,
bindingCounter = bindingCounter
}
end
val nullLex = initial (fn () => NONE, []);
(* Error messages *)
fun errorOccurred ({errors, ...}: lexan) = ! errors;
fun location ({fileName, startLine, endLine, startPosition, endPosition,...}:lexan) =
{ file = fileName, startLine = !startLine, endLine = !endLine,
startPosition = !startPosition, endPosition = !endPosition}
fun reportError ({messageOut,errors,...} : lexan) (report as { hard, ...}) =
(
(* If this is a hard error we have to set the flag
to prevent further passes. *)
if hard then errors := true else ();
messageOut report
)
(* Record the position of the current symbol.
This sets the start for the current symbol to the last recorded
end and sets the new end to the current position. *)
fun setSymbolStart {getLineNo, getOffset, startLine, endLine, startPosition, endPosition, ...} =
let
val line = getLineNo() and offset = getOffset()
in
startLine := ! endLine; endLine := line;
startPosition := ! endPosition; endPosition := offset
end
fun setSymbolEnd {getLineNo, getOffset, endLine, endPosition, ...} =
let
val line = getLineNo() and offset = getOffset()
in
endLine := line;
endPosition := offset
end
(* Convert a piece of text into a series of words so that the
pretty printing can break it into lines. *)
fun breakWords str =
let
val words = String.tokens Char.isSpace str
fun addBreaks [] = [PrettyString ""] (* Shouldn't happen *)
| addBreaks [last] = [PrettyString last]
| addBreaks (hd :: tl) =
PrettyString hd :: PrettyBreak(1, 0) :: addBreaks tl
in
addBreaks words
end
(* Simple string error messages. *)
fun errorMessage (lexan, location, message) =
reportError lexan
{
location = location,
message = PrettyBlock(3, false, [], breakWords message),
hard = true,
context = NONE
}
and warningMessage (lexan, location, message) =
reportError lexan
{
location = location,
message = PrettyBlock(3, false, [], breakWords message),
hard = false, (* Just a warning *)
context = NONE
}
(* Errors within the lexer. *)
fun lexError(state, text) =
(
setSymbolEnd state;
errorMessage (state, location state, text)
)
exception EndOfLine;
(* "ch" contains the next character in the stream. extraChars is a hack that is
needed to deal with a number that looks like it might be a real number
but actually isn't. *)
fun nextCh({ch, stream, extraChars = ref [], ...}) = ch := getOpt(stream(), eofChar)
| nextCh({ch, extraChars = extra as ref(c::l), ...}) = (extra := l; ch := c)
(* Skip over white space. If we have to skip we record this as the END of
the previous symbol. If it turns out that the character is actually
the start of a symbol then this will be set as the START by setSymbolStart. *)
fun skipWhiteSpace (state as {ch = ref c, ...}:lexan) : char =
if isWhiteSpace c
then (setSymbolEnd state; nextCh state; skipWhiteSpace state)
else c
(* Leave string construction until we have all the characters. Since
Single character strings are the same as single characters it doesn't
cost anything to apply "str" but it allows us to conatenate with any
prefix string in one go. *)
fun readChars (state as { ch, ... }) (isOk: char -> bool) (s: string) : string =
let
fun loop (): string list =
let
val theChar = ! ch;
in
if isOk theChar
then (setSymbolEnd state; nextCh state; str theChar :: loop ())
else []
end;
in
concat (s :: loop ())
end;
(* Read in a number. *)
fun parseNumber (hasMinus, state as { sy, id, ch, extraChars, ... }) =
(
sy := IntegerConst;
(* Copy digits into the buffer. *)
id := readChars state isNumeric "";
(* May be the end of an integer, part of a real number,
or w for word or x for hex. *)
(* Since "0" is a valid integer what follows it is only treated
as part of the integer if it is well-formed. If it is not
we return the "0" as an integer constant and leave the rest
to be returned. In particular that means that 0wxz is
the INTEGER constant "0" followed by the identifier "wxz".
N.B. ~0w1 is ~0 w1 because word constants cannot begin with ~. *)
if not hasMinus andalso !ch = #"w" andalso !id = "0"
then (* word constant; if it's well formed. *)
(
nextCh state;
if !ch = #"x"
then
(
nextCh state;
if isHexadecimal (!ch)
then
(
sy := WordConst;
id := readChars state isHexadecimal "0wx"
)
else (extraChars := [#"x", !ch]; ch := #"w")
)
else if isNumeric (!ch)
then
(
sy := WordConst;
id := readChars state isNumeric "0w"
)
else (extraChars := [!ch]; ch := #"w")
)
else if !ch = #"x" andalso !id = "0"
then (* Hexadecimal integer constant. *)
(
nextCh state;
if isHexadecimal (!ch)
then id := readChars state isHexadecimal "0x"
else (extraChars := [!ch]; ch := #"x")
)
else if !ch = #"." orelse
!ch = #"E" orelse !ch = #"e" (* "e" is allowed in ML97 *)
then (* possible real constant. *)
(
if !ch = #"."
then
(
sy := RealConst;
(* Add the "." to the string. *)
id := !id ^ ".";
nextCh state;
(* Must be followed by at least one digit. *)
if not (isNumeric (!ch))
then lexError(state, "malformed real number: " ^ !id ^ str(!ch))
else id := readChars state isNumeric (!id)
)
else ();
(* There's a nasty here. We may actually have 1e~; which should
(probably) be treated as 1 e ~ ; That means that if after we've
read the e and possible ~ we find that the next character is not
a digit we return the number read so far and leave the e, ~
and whatever character we found to be read next time. *)
if !ch = #"E" orelse !ch = #"e"
then
let
val eChar = !ch
in
nextCh state;
(* May be followed by a ~ *)
(* If it's followed by a digit we have an exponent otherwise
we have a number followed by a identifier. In that case
we have to leave the identifier until the next time we're called. *)
if !ch = #"~"
then
(
nextCh state;
if isNumeric(!ch)
then (sy := RealConst; id := readChars state isNumeric (!id ^ "E~"))
else (extraChars := [#"~", !ch]; ch := eChar)
)
else
(
if isNumeric(!ch)
then (sy := RealConst; id := readChars state isNumeric (!id ^ "E"))
else (extraChars := [!ch]; ch := eChar)
)
end
else ()
)
else ()
);
fun parseString (state as { ch, id, ... }) =
let
(* The original version of this simply concatenated the characters onto "id".
For very long strings that's expensive since each concatenation copies the
existing string, resulting in quadratic performance. This version creates a
list and then implodes it. DCJM 24/5/02. *)
fun getString (soFar: char list) =
(
case !ch of
#"\"" (* double-quote. *) => (* Finished - return result. *) (setSymbolEnd state; nextCh state; soFar)
| #"\n" => (setSymbolEnd state; nextCh state; raise EndOfLine)
| #"\\" => (* Escape *)
let
val _ = nextCh state; (* Skip the escape char. *)
val next = !ch; (* Look at the next char. *)
val _ = nextCh state;
in
(* Remove \f...\ sequences but otherwise leave the string
as it is. Escape sequences are processed in the conversion
function. In particular we can only decide whether \uxxxx
is valid when we know whether we are converting to Ascii or
Unicode. *)
if isWhiteSpace next
then
(
if skipWhiteSpace state = #"\\" then ()
else
(
lexError(state, "unexpected character " ^
String.toString (str (!ch)) ^" in \\ ... \\");
while !ch <> #"\\" andalso !ch <> #"\"" andalso !ch <> eofChar
do nextCh state
);
nextCh state;
getString soFar
)
else if next = #"^" (* \^c escape sequence for Control+c *)
then let
val next2 = !ch;
val _ = nextCh state;
in getString (next2 :: #"^" :: #"\\" :: soFar)
end
else getString (next :: #"\\" :: soFar)
end
| ch => (* Anything else *)
(
nextCh state;
if ch = eofChar then raise EndOfLine
else if Char.isPrint ch (* Ok if it's printable. *)
then getString (ch :: soFar)
else (* Report unprintable characters. *)
(
lexError(state, "unprintable character " ^ Char.toString ch ^ " found in string");
getString soFar
)
)
)
in
nextCh state; (* Skip the opening quote. *)
id := String.implode(List.rev(getString []))
handle EndOfLine =>
lexError(state, "no matching quote found on this line")
end (* parseString *)
(* parseComment deals with nested comments.
Returns with !ch containing the first character AFTER the comment. *)
fun parseComment (state as { stream, ch, ... }) =
let
(* skipComment is called after we've already seen the "(" and "*",
and returns the first chararacter AFTER the comment. *)
fun skipComment () : char =
let
(* Returns the first chararacter AFTER the comment *)
fun skipCommentBody (firstCh : char) : char =
if firstCh = eofChar
then
(
setSymbolEnd state;
lexError(state, "end of file found in comment");
firstCh
)
else case (firstCh, getOpt(stream (), eofChar)) of
(#"*", #")") => getOpt(stream (), eofChar) (* End of comment - return next ch. *)
| (#"(", #"*") => skipCommentBody (skipComment ()) (* Nested comment. *)
| (_, nextCh) => skipCommentBody nextCh
in
skipCommentBody (getOpt(stream (), eofChar)) (* Skip the initial "*" *)
end; (* skipComment *)
in
ch := skipComment ()
end (* parseComment *);
(* Sets "id" and "sy" if an identifier is read.
Looks up a word to see if it is reserved. *)
fun parseIdent (state as { ch, id, sy, ... }) charsetTest first (* any characters read so far *) =
let
val idVal = readChars state charsetTest first;
in
(* Qualified names may involve fields of different lexical form
e.g. A.B.+ *)
if !ch = #"." (* May be qualified *)
then
let
val () = nextCh state;
val c = !ch;
in
if isAlphabetic c
then parseIdent state isAlphaNumeric (idVal ^ ".")
else if isOperator c
then parseIdent state isOperator (idVal ^ ".")
else lexError(state, "invalid identifier - "^ idVal ^ "." ^ str c)
end
else
(
id := idVal;
sy := (if 0 < size idVal andalso String.str(String.sub(idVal, 0)) = "'"
then TypeIdent
else lookup idVal)
)
end; (* parseIdent *)
(* Main lexical analyser loop. *)
fun parseToken (state as { ch, id, sy, ... }) =
let
val nextSym = skipWhiteSpace state (* remove leading spaces *)
in
setSymbolStart state; (* Set the start to the previous end and the end to after this. *)
case nextSym of
#"~" => (* Either an operator or part of a number. *)
(
nextCh state;(* get next character *)
if isNumeric (!ch)
then
(
(* Read the number and sets sy to integerConst. *)
parseNumber(true, state);
(* Prepend the "~" to the num *)
id := "~" ^ !id
)
else
(* Part of an operator. *)
parseIdent state isOperator "~"
)
| #"#" =>(* Either an operator, which include a field selection or
a character constant.
N.B. It is not absolutely clear whether any separator
is allowed between # and the following string constant.
Assume that it isn't for the moment. *)
(
nextCh state;(* get next character *)
if !ch = #"\""
then (parseString state; sy := CharConst)
else
(* Part of an operator. *)
parseIdent state isOperator "#"
)
| #"\"" (* double quote. *) => (parseString state; sy := StringConst)
| #";" =>
(
sy := Semicolon;
(* This is a special case. If this is the final semicolon
in the top-dec we mustn't read the next character because
that will be put into "ch" field of this lex object and will
then be discarded. Instead we clobber this with a space so that
the normal space-skipping case will apply. *)
ch := #" "
)
| #"," => (sy := Comma; nextCh state)
| #"(" =>
(
nextCh state;
if !ch <> #"*" then sy := LeftParen else parseComment state
)
| #")" => (sy := RightParen; nextCh state)
| #"[" => (sy := LeftBrack; nextCh state)
| #"]" => (sy := RightBrack; nextCh state)
| #"_" => (sy := Underline; nextCh state)
| #"{" => (sy := LeftCurly; nextCh state)
| #"}" => (sy := RightCurly; nextCh state)
| #"." => (* "..." *)
(
nextCh state;
if !ch <> #"."
then lexError(state, "unknown symbol ." ^ str(!ch))
else
(
setSymbolEnd state;
nextCh state;
if !ch <> #"."
then lexError(state, "unknown symbol .." ^ str(!ch))
else (sy := ThreeDots; setSymbolEnd state; nextCh state)
)
)
| firstCh =>
(* These can't be so easily incorporated into a "case". *)
if firstCh = eofChar
then sy := AbortParse
else if isNumeric firstCh
then parseNumber(false, state)
else if isAlphabetic firstCh orelse firstCh = #"'"
then parseIdent state isAlphaNumeric ""
else if isOperator firstCh
(* excludes ~ which has already been done *)
then parseIdent state isOperator ""
else let (* illegal character *)
val printableFirstCh = Char.toString firstCh
in
(* Report the character. *)
lexError(state, "unknown character \"" ^ printableFirstCh ^ "\"");
nextCh state
end;
(* Read another token if this wasn't recognised. *)
if (!sy = Othersy) then parseToken state else ()
end; (* parseToken *)
(* Insymbol - exported interface to lexical analyser. *)
fun insymbol (state as {sy,pushedSym,...}:lexan) =
if ! pushedSym <> Othersy then pushedSym := Othersy
(* pushedSym is a hack to handle the difficulty of parsing
val ('a, 'b) f = ... compared with val (a, b) = ... and the
similar fun declarations.
It's also used to handle where type t = int and type ... compared
with where type t = int and S = sig ...*)
else
(
if ! sy = AbortParse (* already end-of-file? *)
then
(
setSymbolStart state;
lexError(state, "unexpected end of file encountered");
raise InternalError "end of file"
)
else ();
sy := Othersy; (* default - anything unrecognisable *)
parseToken state
); (* insymbol *)
fun pushBackSymbol ({pushedSym,...}:lexan, sym) =
(* TODO: This does not restore the location so parses such as val () = ... get the wrong
location for the opening parenthesis. *)
if !pushedSym <> Othersy then raise InternalError "Attempt to push two parentheses"
else pushedSym := sym
(* exported version of sy and id. *)
fun sy ({sy=ref sy, pushedSym = ref pushed, ...}:lexan) =
if pushed <> Othersy then pushed else sy;
fun id ({id=ref id,...}:lexan) = id;
val debugParams = #debugParams
fun newBindingId({bindingCounter, ...}: lexan) = bindingCounter()
val nullLocation: location =
{ file="", startLine=0, startPosition=0, endLine=0, endPosition=0 }
(* Construct the location that includes all the locations in
the list. Used to combine the locations of individual lexical
units into a location for a larger syntactic unit. *)
fun locSpan ({ file, startLine, startPosition, ... }: location,
{ endLine, endPosition, ... }: location) =
{
file=file, startLine=startLine, startPosition=startPosition,
endLine=endLine, endPosition=endPosition
}
fun errorDepth{debugParams, ...} = DEBUG.getParameter DEBUG.errorDepthTag debugParams
structure Sharing =
struct
type pretty = pretty
and lexan = lexan
and sys = sys
end
end (* LEX functor body *);
|