I read in the Sebesta book that the compiler spends most of its time in the lexing source code. Therefore, lexer optimization is a necessity, unlike a syntax analyzer.
If so, why does the lexical analysis stage take so much time compared to parsing in general?
I mean the parsing of the derivation process.
-, , : lexing. , ++ (, g++) , ( , ). , C ++ ( , ).
, . , , .. , () , ().
- , . ,
foreach (x in o)
- "f", "o" ..
( "foreach", "for" ..)
"" . , , , .
, . , , , , , , , .
, , . . , , , , . , , .
Source: https://habr.com/ru/post/1712159/More articles:Regex replace part of string with spaces - javaWPF: Inheritance from HeaderedContentControl - wpfJSTL and Javascript - javascriptReading cookie from WCF web service RESTful - restКаковы преимущества и недостатки JQuery и Glow JavaScript Libraries? - javascriptIs it possible to overestimate the method using the lambda function - c #Help improve Python code with List Comprehensions - pythonКак вы определяете, требует ли персонаж, чтобы клавиша shift была нажата для ввода? - javahttps://translate.googleusercontent.com/translate_c?depth=1&pto=aue&rurl=translate.google.com&sl=ru&sp=nmt4&tl=en&u=https://fooobar.com/questions/1712163/javascript-regex-exec-takes-too-long-to-execute&usg=ALkJrhjzJynayH65kE7gt5P1KCY3NxQsxwfailed to read unknown boot command 0x80000022 - iphoneAll Articles