diff --git a/src/Ramstack.Parsing/Collections/ArrayListDebugView.cs b/src/Ramstack.Parsing/Collections/ArrayListDebugView.cs
deleted file mode 100644
index 0046762..0000000
--- a/src/Ramstack.Parsing/Collections/ArrayListDebugView.cs
+++ /dev/null
@@ -1,14 +0,0 @@
-namespace Ramstack.Parsing.Collections;
-
-/// <summary>
-/// Represents a debugger view for the <see cref="ArrayList{T}"/> structure.
-/// </summary>
-/// <typeparam name="T">The type of items in the <see cref="ArrayList{T}"/>.</typeparam>
-internal sealed class ArrayListDebugView<T>(ArrayList<T> list)
-{
-    /// <summary>
-    /// Gets the array of items contained in the <see cref="ArrayList{T}"/>.
-    /// </summary>
-    [DebuggerBrowsable(DebuggerBrowsableState.RootHidden)]
-    public T[] Items => list.ToArray();
-}
diff --git a/src/Ramstack.Parsing/Collections/ArrayList`1.cs b/src/Ramstack.Parsing/Collections/ArrayList`1.cs
deleted file mode 100644
index 19db9bc..0000000
--- a/src/Ramstack.Parsing/Collections/ArrayList`1.cs
+++ /dev/null
@@ -1,382 +0,0 @@
-using System.Collections;
-
-namespace Ramstack.Parsing.Collections;
-
-/// <summary>
-/// Represents a strongly typed list of objects that can be accessed by index.
-/// </summary>
-/// <typeparam name="T">The type of elements in the list.</typeparam>
-[DebuggerDisplay("Count = {Count}")]
-[DebuggerTypeProxy(typeof(ArrayListDebugView<>))]
-public sealed class ArrayList<T> : IList<T>, IReadOnlyList<T>
-{
-    private T[] _array;
-    private int _count;
-
-    /// <summary>
-    /// Gets the number of items contained in the <see cref="ArrayList{T}"/>.
-    /// </summary>
-    [DebuggerBrowsable(DebuggerBrowsableState.Never)]
-    public int Count => _count;
-
-    /// <summary>
-    /// Gets an item at the specified index.
-    /// </summary>
-    /// <param name="index">The zero-based index of the item to get.</param>
-    public ref T this[int index]
-    {
-        [MethodImpl(MethodImplOptions.AggressiveInlining)]
-        get
-        {
-            var array = _array;
-            var count = _count;
-
-            if ((uint)index >= (uint)count)
-                ThrowHelper.ThrowArgumentOutOfRangeException();
-
-            return ref Unsafe.Add(
-                ref MemoryMarshal.GetArrayDataReference(array),
-                (nint)(uint)index);
-        }
-    }
-
-    /// <summary>
-    /// Initializes a new instance of the <see cref="ArrayList{T}"/>.
-    /// </summary>
-    public ArrayList()
-    {
-        _count = 0;
-        _array = [];
-    }
-
-    /// <summary>
-    /// Initializes a new instance of the <see cref="ArrayList{T}"/> with the specified buffer capacity.
-    /// </summary>
-    /// <param name="capacity">The initial capacity of the buffer.</param>
-    public ArrayList(int capacity)
-    {
-        _count = 0;
-        _array = new T[capacity];
-    }
-
-    /// <summary>
-    /// Initializes a new instance of the <see cref="ArrayList{T}"/> class that contains elements copied
-    /// from the specified span and has sufficient capacity to accommodate the number of elements copied.
-    /// </summary>
-    /// <param name="collection">The collection whose elements are copied to the new list.</param>
-    public ArrayList(ReadOnlySpan<T> collection)
-    {
-        _count = collection.Length;
-        _array = collection.ToArray();
-    }
-
-    /// <inheritdoc />
-    public int IndexOf(T item) =>
-        Array.IndexOf(_array, item, 0, _count);
-
-    /// <inheritdoc />
-    public bool Contains(T item) =>
-        IndexOf(item) >= 0;
-
-    /// <inheritdoc />
-    [MethodImpl(MethodImplOptions.AggressiveInlining)]
-    public void Add(T item)
-    {
-        var array = _array;
-        var count = _count;
-
-        if ((uint)count < (uint)array.Length)
-        {
-            array[count] = item;
-            _count = count + 1;
-        }
-        else
-        {
-            AddSlow(item);
-        }
-    }
-
-    /// <summary>
-    /// Adds the items of the specified span to the end of the list.
-    /// </summary>
-    /// <param name="collection">The readonly span of items to add.</param>
-    public void AddRange(ReadOnlySpan<T> collection)
-    {
-        var array = _array;
-        var count = _count;
-
-        if (array.Length - count < collection.Length)
-            array = Grow(checked(count + collection.Length));
-
-        _count = count + collection.Length;
-        _ = array.Length;
-        collection.TryCopyTo(array.AsSpan(count));
-    }
-
-    /// <inheritdoc />
-    public void Insert(int index, T item)
-    {
-        var count = _count;
-        var array = _array;
-
-        Argument.ThrowIfGreaterThan((uint)index, (uint)count);
-
-        if (count == array.Length)
-            array = Grow(index);
-
-        Array.Copy(
-            sourceArray: array,
-            sourceIndex: index,
-            destinationArray: array,
-            destinationIndex: index + 1,
-            length: count - index);
-
-        _count = count + 1;
-
-        if ((uint)index < (uint)array.Length)
-            array[index] = item;
-    }
-
-    /// <inheritdoc />
-    public bool Remove(T item)
-    {
-        var index = IndexOf(item);
-        if (index >= 0)
-        {
-            RemoveAt(index);
-            return true;
-        }
-
-        return false;
-    }
-
-    /// <inheritdoc />
-    public void RemoveAt(int index)
-    {
-        Argument.ThrowIfGreaterThanOrEqual((uint)index, (uint)_count);
-
-        if (index < --_count)
-            Array.Copy(
-                sourceArray: _array,
-                sourceIndex: index + 1,
-                destinationArray: _array,
-                destinationIndex: index,
-                length: _count - index);
-
-        if (RuntimeHelpers.IsReferenceOrContainsReferences<T>())
-            _array[_count] = default!;
-    }
-
-    /// <summary>
-    /// Removes all elements from the <see cref="ArrayList{T}" />.
-    /// </summary>
-    public void Clear()
-    {
-        if (RuntimeHelpers.IsReferenceOrContainsReferences<T>())
-        {
-            _count = ClearImpl(_array, _count);
-
-            [MethodImpl(MethodImplOptions.NoInlining)]
-            static int ClearImpl(T[] array, int count)
-            {
-                if ((uint)count <= (uint)array.Length)
-                    array.AsSpan(0, count).Clear();
-
-                return 0;
-            }
-        }
-        else
-        {
-            _count = 0;
-        }
-    }
-
-    /// <summary>
-    /// Copies the contents of this list into a destination <see cref="Span{T}"/>.
-    /// </summary>
-    /// <param name="destination">The destination <see cref="Span{T}"/> object.</param>
-    public void CopyTo(Span<T> destination) =>
-        AsSpan().CopyTo(destination);
-
-    /// <summary>
-    /// Attempts to copy the current list to a destination <see cref="Span{T}"/>
-    /// and returns a value that indicates whether the copy operation succeeded.
-    /// </summary>
-    /// <param name="destination">The destination <see cref="Span{T}"/> object.</param>
-    /// <returns>
-    /// <see langword="true"/> if copy operations succeeded; otherwise, <see langword="false"/>.
-    /// </returns>
-    public bool TryCopyTo(Span<T> destination) =>
-        AsSpan().TryCopyTo(destination);
-
-    /// <summary>
-    /// Returns an enumerator that iterates through the <see cref="ArrayList{T}"/>.
-    /// </summary>
-    /// <returns>
-    /// A <see cref="Enumerator"/> for the <see cref="ArrayList{T}"/>.
-    /// </returns>
-    public Enumerator GetEnumerator() =>
-        new Enumerator(this);
-
-    /// <summary>
-    /// Returns a <see cref="Span{T}"/> representing the written data of the current instance.
-    /// </summary>
-    /// <returns>
-    /// A <see cref="Span{T}"/> that represents the data within the current instance.
-    /// </returns>
-    [MethodImpl(MethodImplOptions.AggressiveInlining)]
-    public Span<T> AsSpan()
-    {
-        var array = _array;
-        var count = _count;
-        _ = array.Length;
-
-        return MemoryMarshal.CreateSpan(
-            ref MemoryMarshal.GetArrayDataReference(array),
-            count);
-    }
-
-    /// <summary>
-    /// Copies the elements of the <see cref="ArrayList{T}"/> to a new array.
-    /// </summary>
-    /// <returns>
-    /// An array containing copies of the elements of the <see cref="ArrayList{T}"/>.
-    /// </returns>
-    public T[] ToArray() =>
-        AsSpan().ToArray();
-
-    #region Explicit interface implementations
-
-    /// <inheritdoc />
-    T IList<T>.this[int index]
-    {
-        get => this[index];
-        set => this[index] = value;
-    }
-
-    /// <inheritdoc />
-    T IReadOnlyList<T>.this[int index] => this[index];
-
-    /// <inheritdoc />
-    bool ICollection<T>.IsReadOnly => false;
-
-    /// <inheritdoc />
-    void ICollection<T>.CopyTo(T[] array, int arrayIndex) =>
-        AsSpan().CopyTo(array.AsSpan(arrayIndex));
-
-    /// <inheritdoc />
-    IEnumerator<T> IEnumerable<T>.GetEnumerator() =>
-        GetEnumerator();
-
-    /// <inheritdoc />
-    IEnumerator IEnumerable.GetEnumerator() =>
-        GetEnumerator();
-
-    #endregion
-
-    [MethodImpl(MethodImplOptions.NoInlining)]
-    private void AddSlow(T item)
-    {
-        var array = Grow(1);
-        var count = _count;
-
-        if ((uint)count < (uint)array.Length)
-            array[count] = item;
-
-        _count = count + 1;
-    }
-
-    [MethodImpl(MethodImplOptions.NoInlining)]
-    private T[] Grow(int extra)
-    {
-        var array = _array;
-
-        // ReSharper disable once RedundantOverflowCheckingContext
-        var required = checked(array.Length + extra);
-        var capacity = array.Length != 0 ? array.Length * 2 : 4;
-
-        if ((uint)capacity > (uint)Array.MaxLength)
-            capacity = Array.MaxLength;
-
-        if (capacity < required)
-            capacity = required;
-
-        var destination = new T[capacity];
-        array.AsSpan().TryCopyTo(destination);
-
-        _array = destination;
-        return destination;
-    }
-
-    #region Inner type: Enumerator
-
-    /// <summary>
-    /// Enumerates the items of a <see cref="ArrayList{T}"/>.
-    /// </summary>
-    public struct Enumerator : IEnumerator<T>
-    {
-        private readonly T[] _array;
-        private readonly int _count;
-        private int _index;
-
-        /// <summary>
-        /// Gets the item at the current position of the enumerator.
-        /// </summary>
-        public readonly ref readonly T Current
-        {
-            [MethodImpl(MethodImplOptions.AggressiveInlining)]
-            get
-            {
-                if ((uint)_index >= (uint)_count)
-                    ThrowHelper.ThrowArgumentOutOfRangeException();
-
-                Debug.Assert((uint)_index < (uint)_array.Length);
-
-                return ref Unsafe.Add(
-                    ref MemoryMarshal.GetArrayDataReference(_array),
-                    (nint)(uint)_index);
-            }
-        }
-
-        /// <summary>
-        /// Initializes a new instance of the <see cref="Enumerator"/> structure.
-        /// </summary>
-        /// <param name="list">The list to initialize from.</param>
-        internal Enumerator(ArrayList<T> list)
-        {
-            _index = -1;
-            _count = list._count;
-            _array = list._array;
-        }
-
-        /// <inheritdoc />
-        [MethodImpl(MethodImplOptions.AggressiveInlining)]
-        public bool MoveNext() =>
-            (uint)++_index < (uint)_count;
-
-        /// <inheritdoc />
-        public void Reset() =>
-            _index = -1;
-
-        /// <inheritdoc />
-        T IEnumerator<T>.Current
-        {
-            get
-            {
-                if ((uint)_index >= (uint)_count)
-                    ThrowHelper.ThrowArgumentOutOfRangeException();
-
-                return _array[_index];
-            }
-        }
-
-        /// <inheritdoc />
-        object? IEnumerator.Current => Current;
-
-        /// <inheritdoc />
-        public void Dispose() =>
-            _index = -1;
-    }
-
-    #endregion
-}
diff --git a/src/Ramstack.Parsing/Parser.Choice.cs b/src/Ramstack.Parsing/Parser.Choice.cs
index 4992eeb..bb4e4b2 100644
--- a/src/Ramstack.Parsing/Parser.Choice.cs
+++ b/src/Ramstack.Parsing/Parser.Choice.cs
@@ -16,7 +16,7 @@ public static Parser<T> Choice<T>(params Parser<T>[] parsers)
     {
         Argument.ThrowIfNullOrEmpty(parsers);
 
-        var list = new ArrayList<Parser<T>>();
+        var list = new List<Parser<T>>();
 
         while (true)
         {
diff --git a/src/Ramstack.Parsing/Parser.Repeat.cs b/src/Ramstack.Parsing/Parser.Repeat.cs
index 3bd8e41..eda211c 100644
--- a/src/Ramstack.Parsing/Parser.Repeat.cs
+++ b/src/Ramstack.Parsing/Parser.Repeat.cs
@@ -15,7 +15,7 @@ partial class Parser
     /// <returns>
     /// A parser that applies the specified parser zero or more times.
     /// </returns>
-    public static Parser<ArrayList<T>> ZeroOrMore<T>(this Parser<T> parser) =>
+    public static Parser<List<T>> ZeroOrMore<T>(this Parser<T> parser) =>
         Repeat(parser, 0, int.MaxValue);
 
     /// <summary>
@@ -36,7 +36,7 @@ public static Parser<Unit> ZeroOrMore(this Parser<Unit> parser) =>
     /// <returns>
     /// A parser that applies the specified parser at least once.
     /// </returns>
-    public static Parser<ArrayList<T>> OneOrMore<T>(this Parser<T> parser) =>
+    public static Parser<List<T>> OneOrMore<T>(this Parser<T> parser) =>
         Repeat(parser, 1, int.MaxValue);
 
     /// <summary>
@@ -57,7 +57,7 @@ public static Parser<Unit> OneOrMore(this Parser<Unit> parser) =>
     /// <returns>
     /// A parser that applies the specified parser zero or more times.
     /// </returns>
-    public static Parser<ArrayList<T>> Many<T>(this Parser<T> parser) =>
+    public static Parser<List<T>> Many<T>(this Parser<T> parser) =>
         Repeat(parser, 0, int.MaxValue);
 
     /// <summary>
@@ -79,7 +79,7 @@ public static Parser<Unit> Many(this Parser<Unit> parser) =>
     /// <returns>
     /// A parser that applies the specified parser at least a defined number of times.
     /// </returns>
-    public static Parser<ArrayList<T>> AtLeast<T>(this Parser<T> parser, int count) =>
+    public static Parser<List<T>> AtLeast<T>(this Parser<T> parser, int count) =>
         Repeat(parser, count, int.MaxValue);
 
     /// <summary>
@@ -102,7 +102,7 @@ public static Parser<Unit> AtLeast(this Parser<Unit> parser, int count) =>
     /// <returns>
     /// A parser that applies the specified parser a defined number of times.
     /// </returns>
-    public static Parser<ArrayList<T>> Repeat<T>(this Parser<T> parser, int count) =>
+    public static Parser<List<T>> Repeat<T>(this Parser<T> parser, int count) =>
         Repeat(parser, count, count);
 
     /// <summary>
@@ -126,14 +126,14 @@ public static Parser<Unit> Repeat(this Parser<Unit> parser, int count) =>
     /// <returns>
     /// A parser that applies the specified parser a defined number of times.
     /// </returns>
-    public static Parser<ArrayList<T>> Repeat<T>(this Parser<T> parser, int min, int max)
+    public static Parser<List<T>> Repeat<T>(this Parser<T> parser, int min, int max)
     {
         Argument.ThrowIfNegative(min);
         Argument.ThrowIfNegativeOrZero(max);
         Argument.ThrowIfGreaterThan(min, max);
 
         return parser is ICharClassSupport s
-            ? (Parser<ArrayList<T>>)(object)CreateRepeatParser(s.GetCharClass(), min, max)
+            ? (Parser<List<T>>)(object)CreateRepeatParser(s.GetCharClass(), min, max)
             : new RepeatParser<T>(parser, min, max);
     }
 
@@ -157,7 +157,7 @@ public static Parser<Unit> Repeat(this Parser<Unit> parser, int min, int max)
             : new VoidRepeatParser(parser, min, max);
     }
 
-    private static Parser<ArrayList<char>> CreateRepeatParser(CharClass @class, int min, int max)
+    private static Parser<List<char>> CreateRepeatParser(CharClass @class, int min, int max)
     {
         if (@class.Ranges.Length == 0)
             @class = @class.EnrichRanges();
@@ -207,7 +207,7 @@ private static Parser<ArrayList<char>> CreateRepeatParser(CharClass @class, int
                 new BitVectorSearcher<Block512Bit>(ranges),
                 @class.UnicodeCategories, min, max) { Name = errors };
 
-        var list = new ArrayList<(int comparisons, int consumption, Parser<ArrayList<char>> parser)>();
+        var list = new List<(int comparisons, int consumption, Parser<List<char>> parser)>();
 
         if (true)
         {
@@ -294,7 +294,7 @@ private static Parser<ArrayList<char>> CreateRepeatParser(CharClass @class, int
     /// Represents a parser that applies the specified parser a defined number of times.
     /// </summary>
     /// <typeparam name="T">The type of the value produced by the specified parser.</typeparam>
-    private sealed class RepeatParser<T> : Parser<ArrayList<T>>
+    private sealed class RepeatParser<T> : Parser<List<T>>
     {
         private readonly Parser<T> _parser;
         private readonly int _min;
@@ -310,9 +310,9 @@ public RepeatParser(Parser<T> parser, int min, int max) =>
             (_parser, _min, _max) = (parser, min, max);
 
         /// <inheritdoc />
-        public override bool TryParse(ref ParseContext context, [NotNullWhen(true)] out ArrayList<T>? value)
+        public override bool TryParse(ref ParseContext context, [NotNullWhen(true)] out List<T>? value)
         {
-            var list = new ArrayList<T>();
+            var list = new List<T>();
             var bookmark = context.BookmarkPosition();
             var parser = _parser;
 
@@ -423,7 +423,7 @@ public override bool TryParse(ref ParseContext context, out Unit value)
 
     #region Inner type: RepeatCharClassParser
 
-    private sealed class RepeatCharClassParser<TSearcher> : Parser<ArrayList<char>> where TSearcher : struct, ICharClassRangeSearcher
+    private sealed class RepeatCharClassParser<TSearcher> : Parser<List<char>> where TSearcher : struct, ICharClassRangeSearcher
     {
         private TSearcher _searcher;
         private readonly CharClassUnicodeCategory _categories;
@@ -441,7 +441,7 @@ public RepeatCharClassParser(TSearcher searcher, CharClassUnicodeCategory catego
         }
 
         /// <inheritdoc />
-        public override bool TryParse(ref ParseContext context, [NotNullWhen(true)] out ArrayList<char>? value)
+        public override bool TryParse(ref ParseContext context, [NotNullWhen(true)] out List<char>? value)
         {
             value = null;
 
@@ -484,7 +484,7 @@ ref Unsafe.Add(ref MemoryMarshal.GetReference(s), (nint)(uint)index),
                 count = Math.Min(count, _max);
                 context.Advance(count);
 
-                value = new ArrayList<char>(context.MatchedSegment);
+                value = ListFactory<char>.CreateList(context.MatchedSegment);
             }
             else
             {
@@ -495,7 +495,7 @@ ref Unsafe.Add(ref MemoryMarshal.GetReference(s), (nint)(uint)index),
         }
 
         /// <inheritdoc />
-        protected internal override Parser<ArrayList<char>> ToNamedParser(string? name) =>
+        protected internal override Parser<List<char>> ToNamedParser(string? name) =>
             new RepeatCharClassParser<TSearcher>(_searcher, _categories, _min, _max) { Name = name };
 
         /// <inheritdoc />
diff --git a/src/Ramstack.Parsing/Parser.Separated.cs b/src/Ramstack.Parsing/Parser.Separated.cs
index a0be11b..bf5df24 100644
--- a/src/Ramstack.Parsing/Parser.Separated.cs
+++ b/src/Ramstack.Parsing/Parser.Separated.cs
@@ -15,7 +15,7 @@ partial class Parser
     /// /// <returns>
     /// A parser that repeatedly applies the main parser, interleaved with the specified separator.
     /// </returns>
-    public static Parser<ArrayList<T>> Separated<T, TSeparator>(this Parser<T> parser, Parser<TSeparator> separator, bool allowTrailing = false, int min = 0, int max = int.MaxValue) =>
+    public static Parser<List<T>> Separated<T, TSeparator>(this Parser<T> parser, Parser<TSeparator> separator, bool allowTrailing = false, int min = 0, int max = int.MaxValue) =>
         new SeparatedParser<T>(parser, separator.Void(), allowTrailing, min, max);
 
     #region Inner type: SeparatedParser
@@ -29,12 +29,12 @@ public static Parser<ArrayList<T>> Separated<T, TSeparator>(this Parser<T> parse
     /// <param name="allowTrailing"><see langword="true" /> if trailing separator is allowed; otherwise, <see langword="false" />.</param>
     /// <param name="min">The minimum number of repetitions.</param>
     /// <param name="max">The maximum number of repetitions.</param>
-    private sealed class SeparatedParser<T>(Parser<T> parser, Parser<Unit> separator, bool allowTrailing, int min, int max) : Parser<ArrayList<T>>
+    private sealed class SeparatedParser<T>(Parser<T> parser, Parser<Unit> separator, bool allowTrailing, int min, int max) : Parser<List<T>>
     {
         /// <inheritdoc />
-        public override bool TryParse(ref ParseContext context, [NotNullWhen(true)] out ArrayList<T>? value)
+        public override bool TryParse(ref ParseContext context, [NotNullWhen(true)] out List<T>? value)
         {
-            var list = new ArrayList<T>();
+            var list = new List<T>();
             var bookmark = context.BookmarkPosition();
             var separatorBookmark = bookmark;
 
diff --git a/src/Ramstack.Parsing/Parser.Set.cs b/src/Ramstack.Parsing/Parser.Set.cs
index e72c21d..b1ac036 100644
--- a/src/Ramstack.Parsing/Parser.Set.cs
+++ b/src/Ramstack.Parsing/Parser.Set.cs
@@ -144,7 +144,7 @@ internal static Parser<char> Set(CharClass @class)
                 new BitVectorSearcher<Block512Bit>(ranges),
                 categories) { Name = name };
 
-        var list = new ArrayList<(int comparisons, int consumption, Parser<char> parser)>();
+        var list = new List<(int comparisons, int consumption, Parser<char> parser)>();
 
         if (true)
         {
diff --git a/src/Ramstack.Parsing/Parser.Until.cs b/src/Ramstack.Parsing/Parser.Until.cs
index df9ffe1..21ad72f 100644
--- a/src/Ramstack.Parsing/Parser.Until.cs
+++ b/src/Ramstack.Parsing/Parser.Until.cs
@@ -14,7 +14,7 @@ partial class Parser
     /// A parser that applies <paramref name="parser"/> zero or more times, stopping when
     /// <paramref name="terminator"/> succeeds, and returns an array of the results produced by <paramref name="parser"/>.
     /// </returns>
-    public static Parser<ArrayList<T>> Until<T, TTerminator>(this Parser<T> parser, Parser<TTerminator> terminator) =>
+    public static Parser<List<T>> Until<T, TTerminator>(this Parser<T> parser, Parser<TTerminator> terminator) =>
         new UntilParser<T>(parser, terminator.Void());
 
     /// <summary>
@@ -28,7 +28,7 @@ public static Parser<ArrayList<T>> Until<T, TTerminator>(this Parser<T> parser,
     /// A parser that applies <paramref name="parser"/> zero or more times, stopping when
     /// <paramref name="terminator"/> succeeds, and returns an array of the results produced by <paramref name="parser"/>.
     /// </returns>
-    public static Parser<ArrayList<T>> Until<T>(this Parser<T> parser, Parser<Unit> terminator) =>
+    public static Parser<List<T>> Until<T>(this Parser<T> parser, Parser<Unit> terminator) =>
         new UntilParser<T>(parser, terminator);
 
     #region Inner type: UntilParser
@@ -39,14 +39,14 @@ public static Parser<ArrayList<T>> Until<T>(this Parser<T> parser, Parser<Unit>
     /// </summary>
     /// <param name="parser">The main parser to apply repeatedly.</param>
     /// <param name="terminator">The parser that determines when to stop.</param>
-    private sealed class UntilParser<T>(Parser<T> parser, Parser<Unit> terminator) : Parser<ArrayList<T>>
+    private sealed class UntilParser<T>(Parser<T> parser, Parser<Unit> terminator) : Parser<List<T>>
     {
         private readonly Parser<Unit> _isTerminator = And(terminator);
 
         /// <inheritdoc />
-        public override bool TryParse(ref ParseContext context, [NotNullWhen(true)] out ArrayList<T>? value)
+        public override bool TryParse(ref ParseContext context, [NotNullWhen(true)] out List<T>? value)
         {
-            var list = new ArrayList<T>();
+            var list = new List<T>();
             var bookmark = context.BookmarkPosition();
 
             while (true)
diff --git a/src/Ramstack.Parsing/Ramstack.Parsing.csproj b/src/Ramstack.Parsing/Ramstack.Parsing.csproj
index 61b19cd..4b1885a 100644
--- a/src/Ramstack.Parsing/Ramstack.Parsing.csproj
+++ b/src/Ramstack.Parsing/Ramstack.Parsing.csproj
@@ -1,7 +1,7 @@
 <Project Sdk="Microsoft.NET.Sdk">
 
   <PropertyGroup>
-    <TargetFrameworks>net6.0;net7.0;net8.0</TargetFrameworks>
+    <TargetFrameworks>net6.0;net7.0;net8.0;net9.0</TargetFrameworks>
     <Description>A blazing-fast, lightweight, and intuitive parser combinator library for .NET</Description>
     <ImplicitUsings>enable</ImplicitUsings>
     <Nullable>enable</Nullable>
diff --git a/src/Ramstack.Parsing/Utilities/ListFactory.cs b/src/Ramstack.Parsing/Utilities/ListFactory.cs
new file mode 100644
index 0000000..eb37654
--- /dev/null
+++ b/src/Ramstack.Parsing/Utilities/ListFactory.cs
@@ -0,0 +1,68 @@
+namespace Ramstack.Parsing.Utilities;
+
+/// <summary>
+/// Represents the helper class responsible for creating <see cref="List{T}"/> instances
+/// with optimized initialization based on the target framework version.
+/// </summary>
+/// <typeparam name="T">The type of the elements in the list.</typeparam>
+internal static class ListFactory<T>
+{
+    /// <summary>
+    /// Creates a new <see cref="List{T}"/> initialized with the elements from the specified <see cref="ReadOnlySpan{T}"/>.
+    /// </summary>
+    /// <param name="items">The span of items to populate the list with.</param>
+    /// <returns>
+    /// A new <see cref="List{T}"/> containing the specified elements.
+    /// </returns>
+    /// <remarks>
+    /// This method leverages internal optimizations depending on the target framework version
+    /// to efficiently populate the list with the specified items.
+    /// </remarks>
+    [MethodImpl(MethodImplOptions.AggressiveInlining)]
+    public static List<T> CreateList(ReadOnlySpan<T> items)
+    {
+        #if NET9_0_OR_GREATER
+        var list = new List<T>();
+        GetCount(list) = items.Length;
+        GetArray(list) = items.ToArray();
+        return list;
+        #elif NET8_0_OR_GREATER
+        var list = new List<T>(items.Length);
+        if (items.Length != 0)
+        {
+            CollectionsMarshal.SetCount(list, items.Length);
+            items.TryCopyTo(CollectionsMarshal.AsSpan(list));
+        }
+        return list;
+        #else
+        var list = new List<T>(items.Length);
+        foreach (var item in items)
+            list.Add(item);
+        return list;
+        #endif
+    }
+
+    #if NET9_0_OR_GREATER
+    /// <summary>
+    /// Returns a reference to the internal array buffer of the specified <see cref="List{T}"/>.
+    /// </summary>
+    /// <param name="list">The list whose internal buffer is to be accessed.</param>
+    /// <returns>
+    /// A reference to the internal array used by the list.
+    /// </returns>
+    [UnsafeAccessor(UnsafeAccessorKind.Field, Name = "_items")]
+    private static extern ref T[] GetArray(List<T> list);
+
+    /// <summary>
+    /// Returns a reference to the internal "_size" field of the specified <see cref="List{T}"/>
+    /// representing the number of elements in the list.
+    /// </summary>
+    /// <param name="list">The list whose internal "_size" field is to be accessed.</param>
+    /// <returns>
+    /// A reference to the internal "_size" field representing the number of elements in the list.
+    /// </returns>
+    [UnsafeAccessor(UnsafeAccessorKind.Field, Name = "_size")]
+    private static extern ref int GetCount(List<T> list);
+    #endif
+}
+
diff --git a/tests/Ramstack.Parsing.Tests/Collections/ArrayListTests.cs b/tests/Ramstack.Parsing.Tests/Collections/ArrayListTests.cs
deleted file mode 100644
index d62ff85..0000000
--- a/tests/Ramstack.Parsing.Tests/Collections/ArrayListTests.cs
+++ /dev/null
@@ -1,345 +0,0 @@
-namespace Ramstack.Parsing.Collections;
-
-[TestFixture]
-public class ArrayListTests
-{
-    [TestCase(0)]
-    [TestCase(1)]
-    [TestCase(2)]
-    [TestCase(3)]
-    [TestCase(9)]
-    public void Ctor_Capacity(int capacity)
-    {
-        var list = new ArrayList<int>(capacity);
-
-        foreach (var _ in list)
-            Assert.Fail();
-
-        foreach (var _ in list.AsSpan())
-            Assert.Fail();
-
-        Assert.That(list.Count, Is.Zero);
-        Assert.That(list.ToArray(), Is.SameAs(Array.Empty<int>()));
-        Assert.That(list.Clear, Throws.Nothing);
-    }
-
-    [TestCase(-1)]
-    [TestCase(int.MinValue)]
-    [TestCase(int.MaxValue)]
-    public void Ctor_InvalidCapacity_ShouldThrow(int capacity)
-    {
-        Assert.That(
-            () => new ArrayList<int>(capacity),
-            Throws.TypeOf<OverflowException>().Or.TypeOf<OutOfMemoryException>());
-    }
-
-    [Test]
-    public void Indexer_ReturnsReference()
-    {
-        var list = new ArrayList<int>();
-        for (var i = 1; i <= 5; i++)
-            list.Add(i);
-
-        list[1] = 10;
-
-        Assert.That(list[3], Is.EqualTo(4));
-
-        ref var value = ref list[3];
-        value = 20;
-
-        Assert.That(list[3], Is.EqualTo(20));
-        Assert.That(
-            list.ToArray(),
-            Is.EquivalentTo([1, 10, 3, 20, 5]));
-    }
-
-    [Test]
-    public void Indexer_ReturnsValue()
-    {
-        var list = new ArrayList<int>();
-        for (var i = 0; i < 5; i++)
-            list.Add(i);
-
-        for (var i = 0; i < list.Count; i++)
-            Assert.That(list[i], Is.EqualTo(i));
-    }
-
-    [Test]
-    public void Indexer_InvalidIndex_ShouldThrow()
-    {
-        var list = new ArrayList<int>();
-        Assert.That(
-            () => list[0],
-            Throws.TypeOf<ArgumentOutOfRangeException>());
-
-        for (var i = 0; i < 5; i++)
-            list.Add(i);
-
-        Assert.That(
-            () => list[6],
-            Throws.TypeOf<ArgumentOutOfRangeException>());
-    }
-
-    [Test]
-    public void Add_ValueAdded()
-    {
-        var list = new ArrayList<int> { 10 };
-
-        Assert.That(list.Count, Is.EqualTo(1));
-        Assert.That(list.ToArray(), Is.EquivalentTo([10]));
-    }
-
-    [Test]
-    public void Add_MultipleValues_AllValuesAdded()
-    {
-        const int Count = 999;
-
-        var list = new ArrayList<object>(4);
-        for (var i = 0; i < Count; i++)
-            list.Add(i);
-
-        Assert.That(list.Count, Is.EqualTo(Count));
-        Assert.That(list.ToArray().Length, Is.EqualTo(Count));
-    }
-
-    [Test]
-    public void Insert_ValuesAdded()
-    {
-        var list = new ArrayList<object>();
-        for (var i = 0; i < 10; i++)
-            list.Insert(i, i);
-
-        Assert.That(list.Count, Is.EqualTo(10));
-        Assert.That(list.ToArray(), Is.EquivalentTo(Enumerable.Range(0, 10)));
-    }
-
-    [Test]
-    public void Insert_FromStart_ValuesAdded()
-    {
-        var list = new ArrayList<int>(4);
-        for (var i = 0; i < 10; i++)
-            list.Insert(0, i);
-
-        Assert.That(list.Count, Is.EqualTo(10));
-        Assert.That(list.ToArray(), Is.EquivalentTo(Enumerable.Range(0, 10).Reverse()));
-    }
-
-    [Test]
-    public void Insert_OutOfRange_ShouldThrow()
-    {
-        var list = new ArrayList<int>();
-        for (var i = 0; i < 10; i++)
-            list.Insert(0, i);
-
-        Assert.Throws<ArgumentOutOfRangeException>(() => list.Insert(11, 0));
-        Assert.That(list.Count, Is.EqualTo(10));
-    }
-
-    [Test]
-    public void RemoveAt_EmptyList_ShouldThrow()
-    {
-        // ReSharper disable once CollectionNeverUpdated.Local
-        var list = new ArrayList<int>();
-
-        Assert.Throws<ArgumentOutOfRangeException>(() => list.RemoveAt(0));
-        Assert.Throws<ArgumentOutOfRangeException>(() => list.RemoveAt(5));
-        Assert.That(list.Count, Is.EqualTo(0));
-    }
-
-    [Test]
-    public void RemoveAt_OutOfRange_ShouldThrow()
-    {
-        var list = new ArrayList<int>();
-        for (var i = 0; i < 5; i++)
-            list.Add(i);
-
-        Assert.Throws<ArgumentOutOfRangeException>(() => list.RemoveAt(5));
-        Assert.That(list.Count, Is.EqualTo(5));
-    }
-
-    [Test]
-    public void RemoveAt_FromStart_ValueRemoved()
-    {
-        const int Count = 100;
-
-        var reference = new List<string?>();
-        var list = new ArrayList<string?>();
-
-        for (var i = 0; i < Count; i++)
-        {
-            list.Add(i.ToString());
-            reference.Add(i.ToString());
-        }
-
-        for (var i = 0; i < Count; i++)
-        {
-            list.RemoveAt(0);
-            reference.RemoveAt(0);
-
-            Assert.That(list.Count, Is.EqualTo(reference.Count));
-            Assert.That(list, Is.EquivalentTo(reference));
-            Assert.That(list.ToArray(), Is.EquivalentTo(reference));
-        }
-
-        Assert.That(list.Count, Is.Zero);
-        Assert.That(list.Any(), Is.False);
-    }
-
-    [Test]
-    public void RemoveAt_FromEnd_ValueRemoved()
-    {
-        const int Count = 100;
-
-        var reference = new List<string?>();
-        var list = new ArrayList<string?>();
-
-        for (var i = 0; i < Count; i++)
-        {
-            list.Add(i.ToString());
-            reference.Add(i.ToString());
-        }
-
-        for (var i = Count - 1; i >= 0; i--)
-        {
-            list.RemoveAt(i);
-            reference.RemoveAt(i);
-
-            Assert.That(list.Count, Is.EqualTo(reference.Count));
-            Assert.That(list, Is.EquivalentTo(reference));
-            Assert.That(list.ToArray(), Is.EquivalentTo(reference));
-        }
-
-        Assert.That(list.Count, Is.Zero);
-        Assert.That(list.Any(), Is.False);
-    }
-
-    [Test]
-    public void RemoveAt_RemoveAll_AllValuesRemoved()
-    {
-        const int Count = 100;
-
-        var list = new ArrayList<int>();
-        for (var i = 0; i < Count; i++)
-            list.Add(i);
-
-        for (var i = 0; i < Count; i++)
-            list.RemoveAt(0);
-
-        Assert.That(list.Count, Is.EqualTo(0));
-        Assert.That(list, Is.EquivalentTo(Array.Empty<int>()));
-        Assert.That(list.ToArray(), Is.EquivalentTo(Array.Empty<int>()));
-    }
-
-    [Test]
-    public void Clear_AllValuesRemoved()
-    {
-        var list = new ArrayList<string?>();
-        for (var i = 0; i < 10; i++)
-            list.Add(i.ToString());
-
-        list.Clear();
-
-        Assert.That(list.Count, Is.Zero);
-        Assert.That(list, Is.EquivalentTo(Array.Empty<int>()));
-        Assert.That(list.ToArray(), Is.EquivalentTo(Array.Empty<int>()));
-    }
-
-    [Test]
-    public void RemoveAt_RemoveReferenceValue_ArrayElementNullified()
-    {
-        var list = new ArrayList<string>();
-        for (var i = 0; i < 4; i++)
-            list.Add(i.ToString());
-
-        ref var r2 = ref list[2];
-        ref var r3 = ref list[3];
-
-        Assert.That(list, Is.EquivalentTo(["0", "1", "2", "3"]));
-
-        list.RemoveAt(3);
-
-        Assert.That(list, Is.EquivalentTo(["0", "1", "2"]));
-        Assert.That(r3, Is.Null);
-
-        list.RemoveAt(0);
-        Assert.That(list, Is.EquivalentTo(["1", "2"]));
-        Assert.That(r2, Is.Null);
-    }
-
-    [Test]
-    public void Clear_ReferenceValues_ArrayElementNullified()
-    {
-        var list = new ArrayList<string>();
-        for (var i = 0; i < 4; i++)
-            list.Add(i.ToString());
-
-        ref var r0 = ref list[0];
-        ref var r1 = ref list[1];
-        ref var r2 = ref list[2];
-        ref var r3 = ref list[3];
-
-        list.Clear();
-
-        Assert.That(list, Is.Empty);
-        Assert.That(r0, Is.Null);
-        Assert.That(r1, Is.Null);
-        Assert.That(r2, Is.Null);
-        Assert.That(r3, Is.Null);
-    }
-
-    [TestCase(0)]
-    [TestCase(2)]
-    [TestCase(4)]
-    [TestCase(5)]
-    public void AsSpan_Empty(int capacity)
-    {
-        var list = new ArrayList<int>(capacity);
-
-        Assert.That(list.Count, Is.Zero);
-        Assert.That(list.AsSpan().Length, Is.Zero);
-    }
-
-    [TestCase(0)]
-    [TestCase(1)]
-    [TestCase(4)]
-    [TestCase(7)]
-    [TestCase(9)]
-    public void ToArray(int count)
-    {
-        var list = new ArrayList<int>(count);
-        for (var i = 0; i < count; i++)
-            list.Add(i);
-
-        Assert.That(list.ToArray(), Is.EquivalentTo(Enumerable.Range(0, count)));
-        Assert.That(list.Count, Is.EqualTo(count));
-    }
-
-    [Test]
-    public void ToArray_Empty()
-    {
-        Assert.That(new ArrayList<string>().ToArray(), Is.Empty);
-    }
-
-    [TestCase(0)]
-    [TestCase(1)]
-    [TestCase(4)]
-    [TestCase(7)]
-    [TestCase(9)]
-    public void AsSpan(int count)
-    {
-        var list = new ArrayList<int>(count);
-        for (var i = 0; i < count; i++)
-            list.Add(i);
-
-        Assert.That(
-            list.AsSpan().ToArray(),
-            Is.EquivalentTo(Enumerable.Range(0, count)));
-    }
-
-    [Test]
-    public void AsSpan_Empty()
-    {
-        var view = new ArrayList<string>().AsSpan();
-        Assert.That(view.Length, Is.Zero);
-    }
-}
diff --git a/tests/Ramstack.Parsing.Tests/Scenarios/SimpleCalcTests.cs b/tests/Ramstack.Parsing.Tests/Scenarios/SimpleCalcTests.cs
index 6e42a73..69118c6 100644
--- a/tests/Ramstack.Parsing.Tests/Scenarios/SimpleCalcTests.cs
+++ b/tests/Ramstack.Parsing.Tests/Scenarios/SimpleCalcTests.cs
@@ -86,7 +86,7 @@ public void SimpleCalcTest(string text, double number, string error = "")
         var expression =
             sum.Between(S, Eof);
 
-        static double Multiply(double v, ArrayList<(char, Unit, double)> results)
+        static double Multiply(double v, List<(char, Unit, double)> results)
         {
             foreach (var (op, _, d) in results)
                 v = op == '*' ? v * d : v / d;
@@ -94,7 +94,7 @@ static double Multiply(double v, ArrayList<(char, Unit, double)> results)
             return v;
         }
 
-        static double Add(double v, ArrayList<(char, Unit, double)> results)
+        static double Add(double v, List<(char, Unit, double)> results)
         {
             foreach (var (op, _, d) in results)
                 v = op == '+' ? v + d : v - d;