serenity - The Serenity Operating System 🐞

Age	Commit message (Collapse)	Author
2020-04-24	LibJS: Add TokenType::TemplateLiteral	Linus Groh
	This is required for template literals - we're not quite there yet, but at least the parser can now tell us when this token is encountered - currently this yields "Unexpected token Invalid". Not really helpful. The character is a "backtick", but as we already have TokenType::{StringLiteral,RegexLiteral} this seemed like a fitting name. This also enables syntax highlighting for template literals in the js REPL and LibGUI's JSSyntaxHighlighter.
2020-04-18	LibJS: Allow reserved words as keys in object expressions.	Stephan Unverwerth

2020-04-05	LibJS: Add numeric literal parsing for different bases and exponents	Stephan Unverwerth

2020-04-04	LibJS: Hack the lexer to allow numbers with decimals	Andreas Kling
	This is very hackish and should definitely be improved. :^)
2020-03-30	LibJS: Use some macro magic to avoid duplicating all the token types	Andreas Kling

2020-03-29	LibJS: Lexer and parser support for "switch" statements	Andreas Kling

2020-03-21	LibJS: Parse object expressions	0xtechnobabble

2020-03-16	LibJS: Implement null and undefined literals	0xtechnobabble

2020-03-14	LibJS: Unescape strings in Token::string_value()	Stephan Unverwerth

2020-03-14	LibJS: Strip double-quote characters from StringLiteral tokens	Andreas Kling
	This is very hackish since I'm just doing it to make progress on something else. :^)
2020-03-14	LibJS: Lex single quote strings, escaped chars and unterminated strings	Stephan Unverwerth

2020-03-14	LibJS: Add missing tokens to name()	Oriko

2020-03-14	LibJS: Add operator precedence parsing	Stephan Unverwerth
	Obey precedence and associativity rules when parsing expressions with chained operators.
2020-03-12	LibJS: Add Javascript lexer and parser	Stephan Unverwerth
	This adds a basic Javascript lexer and parser. It can parse the currently existing demo programs. More work needs to be done to turn it into a complete parser than can parse arbitrary JS Code. The lexer outputs tokens with preceeding whitespace and comments in the trivia member. This should allow us to generate the exact source code by concatenating the generated tokens. The parser is written in a way that it always returns a complete syntax tree. Error conditions are represented as nodes in the tree. This simplifies the code and allows it to be used as an early stage parser, e.g for parsing JS documents in an IDE while editing the source code.: