Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
#!perl
|
|
|
|
|
|
# vim:ts=4:sw=4:expandtab
|
|
|
|
|
|
#
|
2012-09-10 14:09:01 +02:00
|
|
|
|
# Please read the following documents before working on tests:
|
2017-09-24 10:19:50 +02:00
|
|
|
|
# • https://build.i3wm.org/docs/testsuite.html
|
2012-09-10 14:09:01 +02:00
|
|
|
|
# (or docs/testsuite)
|
|
|
|
|
|
#
|
2017-09-24 10:19:50 +02:00
|
|
|
|
# • https://build.i3wm.org/docs/lib-i3test.html
|
2012-09-10 14:09:01 +02:00
|
|
|
|
# (alternatively: perldoc ./testcases/lib/i3test.pm)
|
|
|
|
|
|
#
|
2017-09-24 10:19:50 +02:00
|
|
|
|
# • https://build.i3wm.org/docs/ipc.html
|
2012-09-10 14:09:01 +02:00
|
|
|
|
# (or docs/ipc)
|
|
|
|
|
|
#
|
|
|
|
|
|
# • http://onyxneon.com/books/modern_perl/modern_perl_a4.pdf
|
|
|
|
|
|
# (unless you are already familiar with Perl)
|
|
|
|
|
|
#
|
Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
# Tests the standalone parser binary to see if it calls the right code when
|
|
|
|
|
|
# confronted with various commands, if it prints proper error messages for
|
|
|
|
|
|
# wrong commands and if it terminates in every case.
|
|
|
|
|
|
#
|
|
|
|
|
|
use i3test i3_autostart => 0;
|
|
|
|
|
|
|
|
|
|
|
|
sub parser_calls {
|
|
|
|
|
|
my ($command) = @_;
|
|
|
|
|
|
|
|
|
|
|
|
# TODO: use a timeout, so that we can error out if it doesn’t terminate
|
|
|
|
|
|
# TODO: better way of passing arguments
|
2016-10-10 21:14:59 +02:00
|
|
|
|
my $stdout = qx(test.commands_parser '$command' 2>&1 >&-);
|
Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
|
|
|
|
|
|
# Filter out all debugging output.
|
|
|
|
|
|
my @lines = split("\n", $stdout);
|
|
|
|
|
|
@lines = grep { not /^# / } @lines;
|
|
|
|
|
|
|
|
|
|
|
|
# The criteria management calls are irrelevant and not what we want to test
|
|
|
|
|
|
# in the first place.
|
|
|
|
|
|
@lines = grep { !(/cmd_criteria_init()/ || /cmd_criteria_match_windows/) } @lines;
|
|
|
|
|
|
return join("\n", @lines);
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
################################################################################
|
|
|
|
|
|
# 1: First that the parser properly recognizes commands which are ok.
|
|
|
|
|
|
################################################################################
|
|
|
|
|
|
|
2012-02-21 14:22:26 +01:00
|
|
|
|
# The first call has only a single command, the following ones are consolidated
|
|
|
|
|
|
# for performance.
|
Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
is(parser_calls('move workspace 3'),
|
2015-10-26 22:38:06 +01:00
|
|
|
|
'cmd_move_con_to_workspace_name(3, (null))',
|
Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
'single number (move workspace 3) ok');
|
|
|
|
|
|
|
2012-02-21 14:22:26 +01:00
|
|
|
|
is(parser_calls(
|
|
|
|
|
|
'move to workspace 3; ' .
|
|
|
|
|
|
'move window to workspace 3; ' .
|
|
|
|
|
|
'move container to workspace 3; ' .
|
|
|
|
|
|
'move workspace foobar; ' .
|
2013-02-19 00:27:55 +01:00
|
|
|
|
'move workspace torrent; ' .
|
|
|
|
|
|
'move workspace to output LVDS1; ' .
|
2012-02-21 14:22:26 +01:00
|
|
|
|
'move workspace 3: foobar; ' .
|
|
|
|
|
|
'move workspace "3: foobar"; ' .
|
|
|
|
|
|
'move workspace "3: foobar, baz"; '),
|
2015-10-26 22:38:06 +01:00
|
|
|
|
"cmd_move_con_to_workspace_name(3, (null))\n" .
|
|
|
|
|
|
"cmd_move_con_to_workspace_name(3, (null))\n" .
|
|
|
|
|
|
"cmd_move_con_to_workspace_name(3, (null))\n" .
|
|
|
|
|
|
"cmd_move_con_to_workspace_name(foobar, (null))\n" .
|
|
|
|
|
|
"cmd_move_con_to_workspace_name(torrent, (null))\n" .
|
2013-02-19 00:27:55 +01:00
|
|
|
|
"cmd_move_workspace_to_output(LVDS1)\n" .
|
2015-10-26 22:38:06 +01:00
|
|
|
|
"cmd_move_con_to_workspace_name(3: foobar, (null))\n" .
|
|
|
|
|
|
"cmd_move_con_to_workspace_name(3: foobar, (null))\n" .
|
|
|
|
|
|
"cmd_move_con_to_workspace_name(3: foobar, baz, (null))",
|
2012-02-21 14:22:26 +01:00
|
|
|
|
'move ok');
|
Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
|
|
|
|
|
|
is(parser_calls('move workspace 3: foobar, nop foo'),
|
2015-10-26 22:38:06 +01:00
|
|
|
|
"cmd_move_con_to_workspace_name(3: foobar, (null))\n" .
|
Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
"cmd_nop(foo)",
|
|
|
|
|
|
'multiple ops (move workspace 3: foobar, nop foo) ok');
|
|
|
|
|
|
|
2012-02-21 14:22:26 +01:00
|
|
|
|
is(parser_calls(
|
|
|
|
|
|
'exec i3-sensible-terminal; ' .
|
|
|
|
|
|
'exec --no-startup-id i3-sensible-terminal'),
|
|
|
|
|
|
"cmd_exec((null), i3-sensible-terminal)\n" .
|
|
|
|
|
|
"cmd_exec(--no-startup-id, i3-sensible-terminal)",
|
Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
'exec ok');
|
|
|
|
|
|
|
2012-02-21 14:22:26 +01:00
|
|
|
|
is(parser_calls(
|
|
|
|
|
|
'resize shrink left; ' .
|
|
|
|
|
|
'resize shrink left 25 px; ' .
|
|
|
|
|
|
'resize shrink left 25 px or 33 ppt; ' .
|
|
|
|
|
|
'resize shrink left 25'),
|
|
|
|
|
|
"cmd_resize(shrink, left, 10, 10)\n" .
|
|
|
|
|
|
"cmd_resize(shrink, left, 25, 10)\n" .
|
|
|
|
|
|
"cmd_resize(shrink, left, 25, 33)\n" .
|
|
|
|
|
|
"cmd_resize(shrink, left, 25, 10)",
|
Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
'simple resize ok');
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls('resize shrink left 25 px or 33 ppt,'),
|
|
|
|
|
|
'cmd_resize(shrink, left, 25, 33)',
|
|
|
|
|
|
'trailing comma resize ok');
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls('resize shrink left 25 px or 33 ppt;'),
|
|
|
|
|
|
'cmd_resize(shrink, left, 25, 33)',
|
|
|
|
|
|
'trailing semicolon resize ok');
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls('[con_mark=yay] focus'),
|
|
|
|
|
|
"cmd_criteria_add(con_mark, yay)\n" .
|
|
|
|
|
|
"cmd_focus()",
|
|
|
|
|
|
'criteria focus ok');
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls("[con_mark=yay con_mark=bar] focus"),
|
|
|
|
|
|
"cmd_criteria_add(con_mark, yay)\n" .
|
|
|
|
|
|
"cmd_criteria_add(con_mark, bar)\n" .
|
|
|
|
|
|
"cmd_focus()",
|
|
|
|
|
|
'criteria focus ok');
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls("[con_mark=yay\tcon_mark=bar] focus"),
|
|
|
|
|
|
"cmd_criteria_add(con_mark, yay)\n" .
|
|
|
|
|
|
"cmd_criteria_add(con_mark, bar)\n" .
|
|
|
|
|
|
"cmd_focus()",
|
|
|
|
|
|
'criteria focus ok');
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls("[con_mark=yay\tcon_mark=bar]\tfocus"),
|
|
|
|
|
|
"cmd_criteria_add(con_mark, yay)\n" .
|
|
|
|
|
|
"cmd_criteria_add(con_mark, bar)\n" .
|
|
|
|
|
|
"cmd_focus()",
|
|
|
|
|
|
'criteria focus ok');
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls('[con_mark="yay"] focus'),
|
|
|
|
|
|
"cmd_criteria_add(con_mark, yay)\n" .
|
|
|
|
|
|
"cmd_focus()",
|
|
|
|
|
|
'quoted criteria focus ok');
|
|
|
|
|
|
|
2012-01-25 23:00:32 +01:00
|
|
|
|
# Make sure trailing whitespace is stripped off: While this is not an issue for
|
|
|
|
|
|
# commands being parsed due to the configuration, people might send IPC
|
|
|
|
|
|
# commands with leading or trailing newlines.
|
|
|
|
|
|
is(parser_calls("workspace test\n"),
|
2015-10-23 23:36:37 +02:00
|
|
|
|
'cmd_workspace_name(test, (null))',
|
2012-01-25 23:00:32 +01:00
|
|
|
|
'trailing whitespace stripped off ok');
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls("\nworkspace test"),
|
2015-10-23 23:36:37 +02:00
|
|
|
|
'cmd_workspace_name(test, (null))',
|
2012-01-25 23:00:32 +01:00
|
|
|
|
'trailing whitespace stripped off ok');
|
|
|
|
|
|
|
Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
################################################################################
|
|
|
|
|
|
# 2: Verify that the parser spits out the right error message on commands which
|
|
|
|
|
|
# are not ok.
|
|
|
|
|
|
################################################################################
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls('unknown_literal'),
|
2016-05-11 20:11:04 +02:00
|
|
|
|
"ERROR: Expected one of these tokens: <end>, '[', '" . join("', '", qw(
|
|
|
|
|
|
move
|
|
|
|
|
|
exec
|
|
|
|
|
|
exit
|
|
|
|
|
|
restart
|
|
|
|
|
|
reload
|
|
|
|
|
|
shmlog
|
|
|
|
|
|
debuglog
|
|
|
|
|
|
border
|
|
|
|
|
|
layout
|
|
|
|
|
|
append_layout
|
|
|
|
|
|
workspace
|
|
|
|
|
|
focus
|
|
|
|
|
|
kill
|
|
|
|
|
|
open
|
|
|
|
|
|
fullscreen
|
|
|
|
|
|
sticky
|
|
|
|
|
|
split
|
|
|
|
|
|
floating
|
|
|
|
|
|
mark
|
|
|
|
|
|
unmark
|
|
|
|
|
|
resize
|
|
|
|
|
|
rename
|
|
|
|
|
|
nop
|
|
|
|
|
|
scratchpad
|
2016-02-26 22:39:44 +01:00
|
|
|
|
swap
|
2016-05-11 20:11:04 +02:00
|
|
|
|
title_format
|
|
|
|
|
|
mode
|
|
|
|
|
|
bar
|
|
|
|
|
|
)) . "'\n" .
|
2012-08-02 17:43:00 +02:00
|
|
|
|
"ERROR: Your command: unknown_literal\n" .
|
|
|
|
|
|
"ERROR: ^^^^^^^^^^^^^^^",
|
Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
'error for unknown literal ok');
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls('move something to somewhere'),
|
2015-10-26 22:38:06 +01:00
|
|
|
|
"ERROR: Expected one of these tokens: 'window', 'container', 'to', '--no-auto-back-and-forth', 'workspace', 'output', 'mark', 'scratchpad', 'left', 'right', 'up', 'down', 'position', 'absolute'\n" .
|
2012-08-02 17:43:00 +02:00
|
|
|
|
"ERROR: Your command: move something to somewhere\n" .
|
|
|
|
|
|
"ERROR: ^^^^^^^^^^^^^^^^^^^^^^",
|
Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
'error for unknown literal ok');
|
|
|
|
|
|
|
2012-01-30 17:55:06 +01:00
|
|
|
|
################################################################################
|
2015-03-25 20:55:26 +01:00
|
|
|
|
# 3: Verify that escaping works correctly
|
2012-01-30 17:55:06 +01:00
|
|
|
|
################################################################################
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls('workspace "foo"'),
|
2015-10-23 23:36:37 +02:00
|
|
|
|
'cmd_workspace_name(foo, (null))',
|
2012-01-30 17:55:06 +01:00
|
|
|
|
'Command with simple double quotes ok');
|
|
|
|
|
|
|
2012-02-10 20:49:38 +01:00
|
|
|
|
is(parser_calls('workspace "foo'),
|
2015-10-23 23:36:37 +02:00
|
|
|
|
'cmd_workspace_name(foo, (null))',
|
2012-02-10 20:49:38 +01:00
|
|
|
|
'Command without ending double quotes ok');
|
|
|
|
|
|
|
2012-01-30 17:55:06 +01:00
|
|
|
|
is(parser_calls('workspace "foo \"bar"'),
|
2015-10-23 23:36:37 +02:00
|
|
|
|
'cmd_workspace_name(foo "bar, (null))',
|
2012-01-30 17:55:06 +01:00
|
|
|
|
'Command with escaped double quotes ok');
|
|
|
|
|
|
|
2015-03-25 20:55:26 +01:00
|
|
|
|
is(parser_calls('workspace "foo \\'),
|
2015-10-23 23:36:37 +02:00
|
|
|
|
'cmd_workspace_name(foo \\, (null))',
|
2015-03-25 20:55:26 +01:00
|
|
|
|
'Command with single backslash in the end ok');
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls('workspace "foo\\\\bar"'),
|
2015-10-23 23:36:37 +02:00
|
|
|
|
'cmd_workspace_name(foo\\bar, (null))',
|
2015-03-25 20:55:26 +01:00
|
|
|
|
'Command with escaped backslashes ok');
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls('workspace "foo\\\\\\"bar"'),
|
2015-10-23 23:36:37 +02:00
|
|
|
|
'cmd_workspace_name(foo\\"bar, (null))',
|
2015-03-25 20:55:26 +01:00
|
|
|
|
'Command with escaped double quotes after escaped backslashes ok');
|
|
|
|
|
|
|
2013-10-09 22:30:41 +02:00
|
|
|
|
################################################################################
|
|
|
|
|
|
# 4: Verify that resize commands with a "px or ppt"-construction are parsed
|
|
|
|
|
|
# correctly
|
|
|
|
|
|
################################################################################
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls("resize shrink width 10 px or"),
|
2015-09-27 16:59:36 +02:00
|
|
|
|
"ERROR: Expected one of these tokens: <number>\n" .
|
2013-10-09 22:30:41 +02:00
|
|
|
|
"ERROR: Your command: resize shrink width 10 px or\n" .
|
|
|
|
|
|
"ERROR: ",
|
|
|
|
|
|
"error for resize command with incomplete 'or'-construction ok");
|
|
|
|
|
|
|
|
|
|
|
|
is(parser_calls("resize grow left 10 px or 20 ppt"),
|
|
|
|
|
|
"cmd_resize(grow, left, 10, 20)",
|
|
|
|
|
|
"resize command with 'or'-construction ok");
|
|
|
|
|
|
|
Implement a new parser for commands. (+test)
On the rationale of using a custom parser instead of a lex/yacc one, see this
quote from src/commands_parser.c:
We use a hand-written parser instead of lex/yacc because our commands are
easy for humans, not for computers. Thus, it’s quite hard to specify a
context-free grammar for the commands. A PEG grammar would be easier, but
there’s downsides to every PEG parser generator I have come accross so far.
This parser is basically a state machine which looks for literals or strings
and can push either on a stack. After identifying a literal or string, it
will either transition to the current state, to a different state, or call a
function (like cmd_move()).
Special care has been taken that error messages are useful and the code is
well testable (when compiled with -DTEST_PARSER it will output to stdout
instead of actually calling any function).
During the migration phase (I plan to completely switch to this parser before
4.2 will be released), the new parser will parse every command you send to
i3 and save the resulting call stack. Then, the old parser will parse your
input and actually execute the commands. Afterwards, both call stacks will be
compared and any differences will be logged.
The new parser works with 100% of the test suite and produces identical call
stacks.
2012-01-14 20:53:29 +01:00
|
|
|
|
done_testing;
|