Papers › Benchmarking Language Models for Code Syntax Understanding

Benchmarking Language Models for Code Syntax Understanding

26 Oct 2022arXiv:2210.14473archive 2025-07-28

Da Shen, Xinyun Chen, Chenguang Wang, Koushik Sen, Dawn Song

Pre-trained language models have demonstrated impressive performance in both natural language processing and program understanding, which represent the input as a token sequence without explicitly modeling its structure. Some prior works show that pre-trained language models can capture the syntactic rules of natural languages without finetuning on syntax understanding tasks. However, there is limited understanding of how well pre-trained models understand the code structure so far. In this work, we perform the first thorough benchmarking of the state-of-the-art pre-trained models for identifying the syntactic structures of programs. Specifically, we introduce CodeSyntax, a large-scale dataset of programs annotated with the syntactic relationships in their corresponding abstract syntax trees. Our key observation is that existing language models pretrained on code still lack the understanding of code syntax. In fact, these pre-trained programming language models fail to match the performance of simple baselines based on positional offsets and keywords. We also present a natural language benchmark to highlight the differences between natural languages and programming languages in terms of syntactic structure understanding. Our findings point out key limitations of existing pre-training methods for programming languages, and suggest the importance of modeling code syntactic structures.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2210.14473")

Code

Syntology Ran 1 of 6 code samples harvested from 1 repository linked to this paper; 5 have no recorded run. Of those that ran: 1 ran with no contract checked.

By repository: official repository: 6 samples from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

dashends/codesyntax officialmentioned in paperpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

6 samples harvested; 1 ran; 0 honoured the contract we drafted; 5 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran
5unverified

Licence: 0 of the 6 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from dashends/codesyntax. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

load_pickle dashends/codesyntax/evaluating_models/NL/preprocess_attn_NL_word_level_sorted.py official repository ran MIT (permissive) · 70f4d7f0b484bff1 · report
align_codebert_tokens dashends/codesyntax/evaluating_models/NL/run_exp_roberta.py official repository unverified MIT (permissive) · 5430d736b8cf5809 · report
convert_line_offset_to_char_offset_java dashends/codesyntax/generating_CodeSyntax/generate_labels_java.py official repository unverified MIT (permissive) · 5d9b89c5a3f31f33 · report
get_label dashends/codesyntax/generating_CodeSyntax/generate_labels_python.py official repository unverified MIT (permissive) · 8d00fe0914d77239 · report
get_word_word_attention dashends/codesyntax/evaluating_models/NL/run_exp_roberta.py official repository unverified MIT (permissive) · 3a8052c9a94959b8 · report
make_attn_word_level dashends/codesyntax/evaluating_models/NL/run_exp_roberta.py official repository unverified MIT (permissive) · 5ea0facdf9ebd883 · report

Tasks

Benchmarking

Datasets

Introduced by this paper, per the archive.

CodeSyntax

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

fail

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections