Skip to content

Commit

Permalink
Browse files Browse the repository at this point in the history
Glossary: remove items even if they have description
Perhaps it made sense to document these things in the glossary back then,
but now that we have proper documentation for these things (which, by they
way, is often much more detailed than these descriptions in the glossary), we
do not have to keep it anymore.

⚠ Deletionism alert! Feel free to revert this commit partially.
  • Loading branch information
AlexDaniel committed Jul 15, 2016
1 parent 598a7ab commit fcddb93
Showing 1 changed file with 0 additions and 52 deletions.
52 changes: 0 additions & 52 deletions doc/Language/glossary.pod6
Expand Up @@ -112,17 +112,6 @@ that name:
say $s.name; # triple
say triple(42); # Undeclared routine: triple
=head1 Any
X<|Any>
The L<class|#Class> from which most things derive (inherit), except for
L<junctions|#Junction>. C<Any> itself derives from L<#Mu>.
=head1 any()
A function generating a L<junction|#Junction> with "or" semantics (aka,
L<#True> if any of its values are C<True>. See also L<any|/routine/any>.
=head1 API
X<|API>
Expand Down Expand Up @@ -150,18 +139,6 @@ specified in the definition of a subroutine/method/callable block.
sub foo($bar) { say $bar } # $bar is a parameter
foo(42); # 42 is an argument
=head1 Array
X<|Array>
L<Array|/type/Array> is a subclass of L<List|/type/List> that is mutable.
This means you can e.g. C<.push> and C<.pop> on an array, whereas you cannot
do that on a list. This is separate from the type of elements in the array:
if they are containers, then they are also mutable, but they don't have to
be. Arrays are typically recognizable by the L<#@> L<sigil|#Sigil>.
my @array = 1, 2, 3;
say @array; # [1 2 3]
=head1 Arity
X<|Arity>
Expand Down Expand Up @@ -228,11 +205,6 @@ values in the junction are True.
=head1 block
X<|block>
=head1 Bool
X<|Bool>
L<#Boolean> type.
=head1 Boolean
X<|Boolean>
Expand Down Expand Up @@ -263,9 +235,6 @@ X<|Class>
A basic software structure in L<#OOP>.
See the L<Wikipedia entry|https://en.wikipedia.org/wiki/Class_%28computer_programming%29>.
=head1 Code
X<|Code>
=head1 Colon Pair and Colon List
X<|Color Pair> X<|Colon List>
Expand Down Expand Up @@ -365,21 +334,6 @@ X<|fiddly>
See L<#Attribute>.
=head1 Grammar
X<|Grammar>
A feature of Perl 6 that uses L<#regex>es to implement a grammar for parsing
text. Perl 6 implementations use grammars themselves to parse the language.
The results of parsing with a grammar can be further passed on to
L<actions|#Actions>. A grammar is composed of methods introduced by one of the
three keywords C<rule>, C<L<#token>>, C<regex>. There is L<#backtrack>ing
only in C<regex> and C<rule> implies L<#whitespace>s between subrules.
Parsing is done conceptually in two phases, L<lexing|#Lexing> and
L<syntax analysis|#Syntax Analysis>. Lexing breaks the input string in tokens
that are the input of L<syntax analysis|#Syntax Analysis>. In Perl 6, things
are not so clear cut and both phases are defined in the L<grammar|#Grammar>.
=head1 handles
X<|handles>
Expand Down Expand Up @@ -626,12 +580,6 @@ X<|JIT>
L<Just-in-time compilation|https://en.wikipedia.org/wiki/Just-in-time_compilation>, a technique for improving the performance of virtual machines.
=head1 Junction
X<|Junction>
A compound type that is transparent to many operations. See
L<Junction|/type/Junction>.
=head1 JVM
X<|JVM>
Expand Down

0 comments on commit fcddb93

Please sign in to comment.