Permalink
Browse files

Fix typos.

  • Loading branch information...
1 parent 5e43338 commit b237786d2b60aecaf09cd59adb6b7d5996d9703d @Util Util committed with Jan 22, 2011
View
2 README.txt
@@ -26,7 +26,7 @@ The things in this repository that work out well may end up being
migrated elsewhere when the time is right (for example, it may be
decided that all NQP implementations should live in the nqp-rx
repository). For now, though, development of the .Net and JVM
-implemenations of NQP and the Perl 6 object model remains in here.
+implementations of NQP and the Perl 6 object model remains in here.
Note that things in here may change very rapidly - if you rely on
anything in this repo for anything then you're nuts. :-)
View
2 dotnet/compiler/DNST.pm
@@ -1,4 +1,4 @@
-# The Dotnet Syntax Tree set of nodes is designed to represent fundemental
+# The Dotnet Syntax Tree set of nodes is designed to represent fundamental
# .Net concepts. This allows most of a PAST compiler for .Net to be
# written and used to generate C# for now, but later we can generate IL.
# A tree must have the form:
View
2 dotnet/compiler/PAST2DNSTCompiler.pm
@@ -1,4 +1,4 @@
-# This is the beginings of a PAST to Dotnet Syntax Tree translator. It'll
+# This is the beginnings of a PAST to Dotnet Syntax Tree translator. It'll
# no doubt evolve somewhat over time, and get filled out as we support more
# and more of PAST.
class PAST2DNSTCompiler;
View
2 dotnet/compiler/ROADMAP.txt
@@ -32,7 +32,7 @@ the ones it depends on should be done.
=== Port PAST::Regex compilation
-This mostly invovles getting regexes, then grammars to compile and run. This
+This mostly involves getting regexes, then grammars to compile and run. This
is mostly a guess at an ordering.
* Stub in basic bits of Capture, Cursor, Match
View
2 dotnet/compiler/bootstrap/DNST.pm
@@ -1,4 +1,4 @@
-# The Dotnet Syntax Tree set of nodes is designed to represent fundemental
+# The Dotnet Syntax Tree set of nodes is designed to represent fundamental
# .Net concepts. This allows most of a PAST compiler for .Net to be
# written and used to generate C# for now, but later we can generate IL.
# A tree must have the form:
View
2 dotnet/runtime/Init.cs
@@ -139,7 +139,7 @@ public static Context LoadSetting(string Name, RakudoObject KnowHOW, RakudoObjec
var SettingContext = (Context)Method.Invoke(null, new object[] { });
// Fudge a few more things in.
- // XXX Should be able to toss all of thse but KnowHOW.
+ // XXX Should be able to toss all of these but KnowHOW.
SettingContext.LexPad.Extend(new string[]
{ "KnowHOW", "KnowHOWAttribute", "print", "say", "capture" });
SettingContext.LexPad.SetByName("KnowHOW", KnowHOW);
View
2 dotnet/runtime/Metamodel/Representations/P6opaque.cs
@@ -306,7 +306,7 @@ private void ComputeSlotAllocation(ThreadContext TC, RakudoObject WHAT)
}
else if (ParentElems > 1)
{
- // Multiple inheritnace, so we can't compute this hierarchy.
+ // Multiple inheritance, so we can't compute this hierarchy.
SlotAllocation = new Dictionary<RakudoObject, Dictionary<string, int>>();
return;
}
View
2 dotnet/runtime/Runtime/Lexpad.cs
@@ -20,7 +20,7 @@ public struct Lexpad
public Dictionary<string, int> SlotMapping;
/// <summary>
- /// The storage assocaited with the lexpad.
+ /// The storage associated with the lexpad.
/// </summary>
public RakudoObject[] Storage;
View
2 dotnet/runtime/Runtime/MultiDispatch/DispatchCache.cs
@@ -42,7 +42,7 @@ internal class DispatchCache
private const int MAX_ARITY = 3;
/// <summary>
- /// Maximum entires we cache per arity. (Good to make it a
+ /// Maximum entries we cache per arity. (Good to make it a
/// power of 2, minus 1.)
/// </summary>
private const int MAX_ENTRIES = 15;
View
6 dotnet/runtime/Runtime/MultiDispatch/MultiDispatcher.cs
@@ -91,13 +91,13 @@ public static RakudoObject FindBestCandidate(ThreadContext TC, RakudoCodeRef.Ins
}
}
- /* Check if it's admissable by arity. */
+ /* Check if it's admissible by arity. */
var NumArgs = NativeCapture.Positionals.Length;
if (NumArgs < Candidate.Sig.NumRequiredPositionals ||
NumArgs > Candidate.Sig.NumPositionals)
continue;
- /* Check if it's admissable by types and definedness. */
+ /* Check if it's admissible by types and definedness. */
var TypeCheckCount = Math.Min(NumArgs, Candidate.Sig.NumPositionals);
var TypeMismatch = false;
for (int i = 0; i < TypeCheckCount; i++) {
@@ -123,7 +123,7 @@ public static RakudoObject FindBestCandidate(ThreadContext TC, RakudoCodeRef.Ins
if (TypeMismatch)
continue;
- /* If we get here, it's an admissable candidate; add to list. */
+ /* If we get here, it's an admissible candidate; add to list. */
PossiblesList.Add(Candidate);
}
View
2 dotnet/runtime/Runtime/Ops/ControlFlow.cs
@@ -43,7 +43,7 @@ public static RakudoObject leave_block(ThreadContext TC, RakudoObject Block, Rak
/// <summary>
/// Throws the specified exception, looking for an exception handler in the
- /// dynmaic scope.
+ /// dynamic scope.
/// </summary>
/// <param name="TC"></param>
/// <param name="ExceptionObject"></param>
View
2 dotnet/runtime/Runtime/Signatures/SignatureBinder.cs
@@ -83,7 +83,7 @@ public static void Bind(ThreadContext TC, Context C, RakudoObject Capture)
CurPositional++;
}
- // Positonal optional?
+ // Positional optional?
else if (Param.Flags == Parameter.OPTIONAL_FLAG)
{
if (CurPositional < Positionals.Length)
View
2 java/README.txt
@@ -132,7 +132,7 @@ an unspecified order. Useful for multicast notification, event handlers
and publish and subscribe architectures.
The C# implementation of 6model uses the 'Func' and '=>' combination in
-KnowHOWBoostrapper and RakudoCodeRef for example. The Java
+KnowHOWBootstrapper and RakudoCodeRef for example. The Java
implementation replaces the Func declaration with an IFunc_XXX interface
declaration that defines a suitably typed Invoke method, and replaces
the => with an anonymous class definition that implements that
View
4 java/compiler/PAST2JSTCompiler.pm
@@ -1,4 +1,4 @@
-# This is the beginings of a PAST to Java Syntax Tree translator. It'll
+# This is the beginnings of a PAST to Java Syntax Tree translator. It'll
# no doubt evolve somewhat over time, and get filled out as we support
# more and more of PAST.
class PAST2JSTCompiler;
@@ -370,7 +370,7 @@ our multi sub jst_for(PAST::Block $block) {
@*INNER_BLOCKS.push($_);
}
- # Finish geneating code setup block call.
+ # Finish generating code setup block call.
$our_sbi_setup.push(JST::New.new(
:type('RakudoCodeRef.IFunc_Body'),
# :type('Func<ThreadContext, RakudoObject, RakudoObject, RakudoObject>'),
View
2 java/runtime/Rakudo/Runtime/Lexpad.java
@@ -20,7 +20,7 @@
public HashMap<String, Integer> SlotMapping;
/// <summary>
- /// The storage assocaited with the lexpad.
+ /// The storage associated with the lexpad.
/// </summary>
public RakudoObject[] Storage;
View
2 java/runtime/Rakudo/Runtime/MultiDispatch/DispatchCache.java
@@ -41,7 +41,7 @@
private int MAX_ARITY = 3; // const int in C#
/// <summary>
- /// Maximum entires we cache per arity. (Good to make it a
+ /// Maximum entries we cache per arity. (Good to make it a
/// power of 2, minus 1.)
/// </summary>
private int MAX_ENTRIES = 15; // const int in C#
View
8 java/runtime/Rakudo/Runtime/MultiDispatch/MultiDispatcher.java
@@ -94,13 +94,13 @@ else if (possiblesList.size() > 1)
}
}
- /* Check if it's admissable by arity. */
+ /* Check if it's admissible by arity. */
int numArgs = nativeCapture.Positionals.length;
if (numArgs < candidate.Sig.NumRequiredPositionals ||
numArgs > candidate.Sig.NumPositionals)
continue;
- /* Check if it's admissable by type. */
+ /* Check if it's admissible by type. */
int typeCheckCount = Math.min(numArgs, candidate.Sig.NumPositionals);
boolean typeMismatch = false;
for (int i = 0; i < typeCheckCount; i++) {
@@ -126,7 +126,7 @@ else if (possiblesList.size() > 1)
if (typeMismatch)
continue;
- /* If we get here, it's an admissable candidate; add to list. */
+ /* If we get here, it's an admissible candidate; add to list. */
possiblesList.add(candidate);
}
@@ -145,7 +145,7 @@ else if (possiblesList.size() > 1)
for (RakudoObject obj : unsorted) {
sorted.add(obj);
}
- sorted.add(null); // XXX does this akshually sort?
+ sorted.add(null); // XXX does this actually sort?
return sorted;
}
View
2 overview.pod
@@ -42,7 +42,7 @@ flexible enough to implement a wide range of object orientated and
type-related features.
Currently, there is interest from the Parrot VM team in adopting 6model.
-Furtheremore, just as the compiler toolkit used to implement Rakudo aims
+Furthermore, just as the compiler toolkit used to implement Rakudo aims
to provide general solutions for implementing compilation for a range
of languages, 6model is also built with a secondary aim of providing a
starting point for implementing the object oriented aspects of a range
View
2 t/nqp/12-logical.t
@@ -25,7 +25,7 @@ ok(!$and_no_branch, "logical && shortcuts, branch not taken");
my $and_branch := 0;
1 && ( $and_branch := 1 );
-ok($and_branch, "logicl && shortcuts, branch taken");
+ok($and_branch, "logical && shortcuts, branch taken");
my $err_no_branch := 1;
$err_no_branch // ( $err_no_branch := -1 );
View
2 t/nqp/56-accessors.t
@@ -1,4 +1,4 @@
-# auto-generatored accessors & mutators
+# auto-generated accessors & mutators
# but not lvalue as in Perl 6, just "fluent" mutator methods
plan(4);

0 comments on commit b237786

Please sign in to comment.